A Dirac-Type Theorem for 3-Uniform Hypergraphs
From MaRDI portal
Publication:3373667
DOI10.1017/S0963548305007042zbMath1082.05057MaRDI QIDQ3373667
Endre Szemerédi, Vojtěch Rödl, Andrzej Ruciński
Publication date: 13 March 2006
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Counting Hamilton cycles in Dirac hypergraphs, Transversal Ck-factors in subgraphs of the balanced blow-up of Ck, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Rainbow spanning structures in graph and hypergraph systems, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Factors in randomly perturbed hypergraphs, Covering cycles in sparse graphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, On powers of tight Hamilton cycles in randomly perturbed hypergraphs, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, A proof of the Erdős-Faber-Lovász conjecture, Finding large rainbow trees in colourings of \(K_{n, n}\), Minimum degree conditions for tight Hamilton cycles, F$F$‐factors in Quasi‐random Hypergraphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Graph and hypergraph packing, Edge-decompositions of graphs with high minimum degree, Edge-decompositions of graphs with high minimum degree, Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree, Spanning surfaces in \(3\)-graphs, Extension of paths and cycles for hypergraphs, Matching of Given Sizes in Hypergraphs, Trees with few leaves in tournaments, Tilings in vertex ordered graphs, Dirac-type theorems in random hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Dirac-type results for tilings and coverings in ordered graphs, On a degree sequence analogue of Pósa's conjecture, Perfect matchings in uniform hypergraphs with large minimum degree, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Co-degree density of hypergraphs, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Hamiltonian paths and cycles in some 4-uniform hypergraphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Monochromatic cycle partitions of graphs with large minimum degree, Monochromatic Hamiltonian Berge-cycles in colored hypergraphs, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Hamilton cycles in sparse robustly expanding digraphs, Long monochromatic Berge cycles in colored 4-uniform hypergraphs, Triangle factors of graphs without large independent sets and of weighted graphs, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, Decomposing tournaments into paths, On extremal hypergraphs for Hamiltonian cycles, A Dirac-type theorem for Berge cycles in random hypergraphs, Loose Hamilton cycles in hypergraphs, On multipartite Hajnal-Szemerédi theorems, Near Perfect Matchings ink-Uniform Hypergraphs, On Directed Versions of the Hajnal–Szemerédi Theorem, Tiling multipartite hypergraphs in quasi-random hypergraphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Minimalist designs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Exact Minimum Codegree Threshold for K−4-Factors, Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs, Recent advances on the Hamiltonian problem: survey III, Forcing large tight components in 3-graphs, Hypergraphs with independent neighborhoods, The bandwidth theorem for locally dense graphs, Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, The Complexity of Perfect Packings in Dense Graphs, Families of triples with high minimum degree are Hamiltonian, Pósa's conjecture for graphs of order at least 2 × 108, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A proof of Ringel's conjecture, Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\), Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs, Note on the 3-graph counting Lemma, An approximate Dirac-type theorem for \(k\)-uniform hypergraphs, A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, On vertex-disjoint paths in regular graphs, On the Hamiltonicity of triple systems with high minimum degree, Finding tight Hamilton cycles in random hypergraphs faster, \(K_r\)-factors in graphs with low independence number, How to avoid using the regularity Lemma: Pósa's conjecture revisited, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Unnamed Item, Short paths in quasi-random triple systems with sparse underlying graphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, A hypergraph regularity method for generalized Turán problems, On Hamiltonian Berge cycles in [3-uniform hypergraphs], The complexity of perfect matchings and packings in dense hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, Hamilton cycles in quasirandom hypergraphs, An asymptotic bound for the strong chromatic number, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Unnamed Item, Perfect matchings in large uniform hypergraphs with large minimum collective degree, Spanning Trees with Few Branch Vertices, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, Sprinkling a Few Random Edges Doubles the Power, Spectra of cycle and path families of oriented hypergraphs, The threshold for the square of a Hamilton cycle, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Hamiltonicity in randomly perturbed hypergraphs, A geometric theory for hypergraph matching, Unnamed Item, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Cyclic triangle factors in regular tournaments, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, Decomposing hypergraphs into cycle factors, Tight bounds for powers of Hamilton cycles in tournaments, Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, A degree sequence Hajnal-Szemerédi theorem
