A Dirac-Type Theorem for 3-Uniform Hypergraphs

Cited In (only showing first 100 items - show all)

Hamiltonian paths and cycles in some 4-uniform hypergraphs
Near Perfect Matchings ink-Uniform Hypergraphs
On Directed Versions of the Hajnal–Szemerédi Theorem
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
On vertex-disjoint paths in regular graphs
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Loose Hamiltonian cycles forced by large $(k-2)$-degree -- sharp version
Dirac-type theorems in random hypergraphs
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
A geometric theory for hypergraph matching
Extension of paths and cycles for hypergraphs
Hamilton cycles in hypergraphs below the Dirac threshold
Monochromatic cycle partitions of graphs with large minimum degree
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
Tilings in vertex ordered graphs
Tight bounds for powers of Hamilton cycles in tournaments
On extremal hypergraphs for Hamiltonian cycles
Minimum codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
A degree sequence Hajnal-Szemerédi theorem
How to avoid using the regularity Lemma: Pósa's conjecture revisited
Monochromatic cycle partitions of $2$-coloured graphs with minimum degree $3n/4$
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Edge-decompositions of graphs with high minimum degree
Edge-decompositions of graphs with high minimum degree
On multipartite Hajnal-Szemerédi theorems
Title not available (Why is that?)
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
An approximate Dirac-type theorem for $k$-uniform hypergraphs
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Hamilton $\ell $-cycles in uniform hypergraphs
Families of triples with high minimum degree are Hamiltonian
Spanning Trees with Few Branch Vertices
Long monochromatic Berge cycles in colored 4-uniform hypergraphs
The bandwidth theorem for locally dense graphs
An asymptotic bound for the strong chromatic number
Minimum degree conditions for tight Hamilton cycles
Pósa's conjecture for graphs of order at least 2 × 10⁸
On a degree sequence analogue of Pósa's conjecture
Co-degree density of hypergraphs
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
Loose Hamilton cycles in hypergraphs
The complexity of perfect matchings and packings in dense hypergraphs
Short paths in quasi-random triple systems with sparse underlying graphs
Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Tiling multipartite hypergraphs in quasi-random hypergraphs
On Degree Sequences Forcing The Square of a Hamilton Cycle
Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Hamilton cycles in quasirandom hypergraphs
Exact Minimum Codegree Threshold for K⁻₄-Factors
Hamiltonicity in randomly perturbed hypergraphs
A proof of the Erdős-Faber-Lovász conjecture
Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
A hypergraph regularity method for generalized Turán problems
Hypergraphs with independent neighborhoods
On the Erdős-Hajnal problem for 3-uniform hypergraphs
Combinatorics. Abstracts from the workshop held January 1--7, 2023
Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
The Complexity of Perfect Packings in Dense Graphs
Hamilton $\ell$-cycles in randomly perturbed hypergraphs
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
Loose Hamiltonian cycles forced by $(k-2)$-degree -- approximate version
Note on the 3-graph counting Lemma
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
On the Hamiltonicity of triple systems with high minimum degree
Forbidding Hamilton cycles in uniform hypergraphs
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
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
Cycle-factors in oriented graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cyclic triangle factors in regular tournaments
$K_r$-factors in graphs with low independence number
Spanning surfaces in $3$-graphs
Covering cycles in sparse graphs
Factors in randomly perturbed hypergraphs
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Sprinkling a Few Random Edges Doubles the Power
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
Trees with few leaves in tournaments
A Dirac-type theorem for Berge cycles in random hypergraphs
Transference for loose Hamilton cycles in random 3-uniform hypergraphs
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
Triangle factors of graphs without large independent sets and of weighted graphs
Rainbow spanning structures in graph and hypergraph systems
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
On extremal hypergraphs for Hamiltonian cycles
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Resilience for tight Hamiltonicity
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
The threshold for the square of a Hamilton cycle

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)