196 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
A general approach to transversal versions of Dirac-type theorems
Given a collection of hypergraphs with the same
vertex set, an -edge graph is a transversal if
there is a bijection such that for
each . How large does the minimum degree of each need to be so
that necessarily contains a copy of that is a transversal?
Each in the collection could be the same hypergraph, hence the minimum
degree of each needs to be large enough to ensure that .
Since its general introduction by Joos and Kim [Bull. Lond. Math. Soc., 2020,
52(3):498-504], a growing body of work has shown that in many cases this lower
bound is tight. In this paper, we give a unified approach to this problem by
providing a widely applicable sufficient condition for this lower bound to be
asymptotically tight. This is general enough to recover many previous results
in the area and obtain novel transversal variants of several classical
Dirac-type results for (powers of) Hamilton cycles. For example, we derive that
any collection of graphs on an -vertex set, each with minimum degree at
least , contains a transversal copy of the -th power of a
Hamilton cycle. This can be viewed as a rainbow version of the P\'osa-Seymour
conjecture.Comment: 21 pages, 4 figures; final version as accepted for publication in the
Bulletin of the London Mathematical Societ
The hitting time of clique factors
In a recent paper, Kahn gave the strongest possible, affirmative, answer to
Shamir's problem, which had been open since the late 1970s: Let and
let be divisible by . Then, in the random -uniform hypergraph process
on vertices, as soon as the last isolated vertex disappears, a perfect
matching emerges. In the present work, we transfer this hitting time result to
the setting of clique factors in the random graph process: At the time that the
last vertex joins a copy of the complete graph , the random graph process
contains a -factor. Our proof draws on a novel sequence of couplings,
extending techniques of Riordan and the first author. An analogous result is
proved for clique factors in the -uniform hypergraph process ()
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Paths and cycles in graphs and hypergraphs
In this thesis we present new results in graph and hypergraph theory all of which feature paths or cycles.
A -uniform tight cycle is a -uniform hypergraph on vertices with a cyclic ordering of its vertices such that the edges are all -sets of consecutive vertices in the ordering.
We consider a generalisation of Lehel's Conjecture, which states that every 2-edge-coloured complete graph can be partitioned into two cycles of distinct colour, to -uniform hypergraphs and prove results in the 4- and 5-uniform case.
For a -uniform hypergraph~, the Ramsey number is the smallest integer such that any 2-edge-colouring of the complete -uniform hypergraph on vertices contains a monochromatic copy of . We determine the Ramsey number for 4-uniform tight cycles asymptotically in the case where the length of the cycle is divisible by 4, by showing that = (5+(1)).
We prove a resilience result for tight Hamiltonicity in random hypergraphs. More precisely, we show that for any >0 and 3 asymptotically almost surely, every subgraph of the binomial random -uniform hypergraph in which all -sets are contained in at least edges has a tight Hamilton cycle.
A random graph model on a host graph is said to be 1-independent if for every pair of vertex-disjoint subsets of , the state of edges (absent or present) in is independent of the state of edges in . We show that = 4 - 2 is the critical probability such that every 1-independent graph model on where each edge is present with probability at least contains an infinite path
Large -tilings in 3-uniform hypergraphs
Let be the 3-graph with two edges intersecting in two vertices. We
prove that every 3-graph on vertices with at least
edges contains a -tiling covering more than vertices, for
sufficiently large and . The bound on the number of edges
is asymptotically best possible and solves a conjecture of the authors for
3-graphs that generalizes the Matching Conjecture of Erd\H{o}s
MCMC Sampling of Directed Flag Complexes with Fixed Undirected Graphs
Constructing null models to test the significance of extracted information is
a crucial step in data analysis. In this work, we provide a uniformly
sampleable null model of directed graphs with the same (or similar) number of
simplices in the flag complex, with the restriction of retaining the underlying
undirected graph. We describe an MCMC-based algorithm to sample from this null
model and statistically investigate the mixing behaviour. This is paired with a
high-performance, Rust-based, publicly available implementation. The motivation
comes from topological data analysis of connectomes in neuroscience. In
particular, we answer the fundamental question: are the high Betti numbers
observed in the investigated graphs evidence of an interesting topology, or are
they merely a byproduct of the high numbers of simplices? Indeed, by applying
our new tool on the connectome of C. Elegans and parts of the statistical
reconstructions of the Blue Brain Project, we find that the Betti numbers
observed are considerable statistical outliers with respect to this new null
model. We thus, for the first time, statistically confirm that topological data
analysis in microscale connectome research is extracting statistically
meaningful information
A general approach to transversal versions of Dirac-type theorems
Given a collection of hypergraphs =(1,...,) with the same vertex set, an -edge graph ⊂∪∈[] is atransversal if there is a bijection ∶()→[] such that ∈(()) for each ∈(). How large does the minimum degree of each need to be so that necessarily contains a copy of that is a transversal? Each in the collection could be the same hypergraph,hence the minimum degree of each needs to be large enough to ensure that ⊆. Since its general introduction by Joos and Kim (Bull. Lond. Math. Soc. 52 (2020)498–504), a growing body of work has shown that inmany cases this lower bound is tight. In this paper, wegive a unified approach to this problem by providinga widely applicable sufficient condition for this lowerbound to be asymptotically tight. This is general enoughto recover many previous results in the area and obtainnovel transversal variants of several classical Dirac-typeresults for (powers of) Hamilton cycles. For example, wederive that any collection of graphs on an -vertex set, each with minimum degree at least (∕( + 1) +(1)), contains a transversal copy of the th power of a Hamilton cycle. This can be viewed as a rainbow versionof the Pósa–Seymour conjecture
The threshold for powers of tight Hamilton cycles in random hypergraphs
We investigate the occurrence of powers of tight Hamilton cycles in random
hypergraphs. For every and , we show that there exists a
constant such that if then
asymptotically almost surely the random hypergraph contains the
th power of a tight Hamilton cycle. This improves on a result of Parczyk and
Person, who proved the same result under the assumption
using a second moment
argument
- …