A Dirac-Type Theorem for 3-Uniform Hypergraphs
From MaRDI portal
(Redirected from Publication:3373667)
Recommendations
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- An approximate Dirac-type theorem for k-uniform hypergraphs
- On Hamiltonian cycles in hypergraphs with dense link graphs
- scientific article; zbMATH DE number 5763200
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Cited in
(only showing first 100 items - show all)- Decomposing tournaments into paths
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
- Exact minimum codegree threshold for K^-_4-factors
- Hamiltonian paths and cycles in some 4-uniform hypergraphs
- Counting Hamilton cycles in Dirac hypergraphs
- Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
- Spectra of cycle and path families of oriented hypergraphs
- Edge-disjoint cycles with the same vertex set
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- On vertex-disjoint paths in regular graphs
- Matchings in multipartite hypergraphs
- Cycle-factors in oriented graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Dirac-type theorems in random hypergraphs
- Cyclic triangle factors in regular tournaments
- \(K_r\)-factors in graphs with low independence number
- Recent advances on the Hamiltonian problem: survey III
- Perfect matchings in uniform hypergraphs with large minimum degree
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Spanning surfaces in \(3\)-graphs
- Extension of paths and cycles for hypergraphs
- Monochromatic cycle partitions of graphs with large minimum degree
- A geometric theory for hypergraph matching
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Covering cycles in sparse graphs
- Hamilton cycles in hypergraphs below the Dirac threshold
- Tilings in vertex ordered graphs
- On extremal hypergraphs for Hamiltonian cycles
- Tight bounds for powers of Hamilton cycles in tournaments
- On perfect subdivision tilings (extended abstract)
- Factors in randomly perturbed hypergraphs
- Longest cycles in 3‐connected hypergraphs and bipartite graphs
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Cycles of every length and orientation in randomly perturbed digraphs (extended abstract)
- A degree sequence Hajnal-Szemerédi theorem
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Trees with few leaves in tournaments
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- A Dirac-type theorem for Berge cycles in random hypergraphs
- Matching of given sizes in hypergraphs
- A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs
- On multipartite Hajnal-Szemerédi theorems
- Edge-decompositions of graphs with high minimum degree
- Edge-decompositions of graphs with high minimum degree
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- Minimum degree conditions for Hamilton l-cycles in k-uniform hypergraphs
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- High-girth Steiner triple systems
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Triangle factors of graphs without large independent sets and of weighted graphs
- Families of triples with high minimum degree are Hamiltonian
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
- On degree sequences forcing the square of a Hamilton cycle
- Tiling directed graphs with tournaments
- Near perfect matchings in \(k\)-uniform hypergraphs
- On extremal hypergraphs for Hamiltonian cycles
- Rainbow spanning structures in graph and hypergraph systems
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- On directed versions of the Hajnal-Szemerédi theorem
- Squares of Hamiltonian cycles in 3-uniform hypergraphs
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Transversal Ck-factors in subgraphs of the balanced blow-up of Ck
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Spanning Trees with Few Branch Vertices
- Resilience for tight Hamiltonicity
- The threshold for the square of a Hamilton cycle
- The bandwidth theorem for locally dense graphs
- An asymptotic bound for the strong chromatic number
- On a degree sequence analogue of Pósa's conjecture
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
- Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
- Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
- Minimum degree conditions for tight Hamilton cycles
- Pósa's conjecture for graphs of order at least 2 × 108
- Decomposing hypergraphs into cycle factors
- Co-degree density of hypergraphs
- The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
- On oriented cycles in randomly perturbed digraphs
- Loose Hamilton cycles in hypergraphs
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- The complexity of perfect matchings and packings in dense hypergraphs
- The complexity of perfect packings in dense graphs
- Short paths in quasi-random triple systems with sparse underlying graphs
- Graph and hypergraph packing
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
- A note on Hamilton -cycle decomposition of complete k-partite hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Stability of transversal Hamilton cycles and paths
This page was built for publication: A Dirac-Type Theorem for 3-Uniform Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373667)
