A Dirac-Type Theorem for 3-Uniform Hypergraphs
From MaRDI portal
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)- Hamiltonicity in randomly perturbed hypergraphs
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- A proof of the Erdős-Faber-Lovász conjecture
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
- Spanning subdivisions in dense digraphs
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Cycles in the coprime hypergraph of integers
- A hypergraph regularity method for generalized Turán problems
- Finding tight Hamilton cycles in random hypergraphs faster
- The complexity of vertex coloring problems in uniform hypergraphs with high degree
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Hypergraphs with independent neighborhoods
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- On the Erdős-Hajnal problem for 3-uniform hypergraphs
- Transversal Hamilton cycle in hypergraph systems
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
- Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- A proof of Ringel's conjecture
- Dirac-type results for tilings and coverings in ordered graphs
- Hamilton -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
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- Finding large rainbow trees in colourings of \(K_{n, n}\)
- F$F$‐factors in Quasi‐random Hypergraphs
- Note on the 3-graph counting Lemma
- Decision problem for perfect matchings in dense \(k\)-uniform hypergraphs
- 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
- Transitive tournament tilings in oriented graphs with large minimum total degree
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs
- Forcing large tight components in 3-graphs
- 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
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- On vertex-disjoint paths in regular graphs
- 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
- 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
- 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
- An approximate Dirac-type theorem for \(k\)-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
- 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
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)
