A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
From MaRDI portal
Publication:6603918
Recommendations
Cites work
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- An n n Latin square has a transversal with at least n- n distinct symbols
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Asymptotic behavior of the chromatic index for hypergraphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- Colorful Matchings
- Dirac-type conditions for spanning bounded-degree hypertrees
- Dirac's theorem for random graphs
- Embedding hypertrees into Steiner triple systems
- Embedding rainbow trees with applications to graph labelling and decomposition
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamiltonian circuits in random graphs
- How many random edges make a dense graph hamiltonian?
- scientific article; zbMATH DE number 3604921 (Why is no real title available?)
- scientific article; zbMATH DE number 3613053 (Why is no real title available?)
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Local resilience of almost spanning trees in random graphs
- Near perfect coverings in graphs and hypergraphs
- New bounds for Ryser’s conjecture and related problems
- On the Size of a Maximum Transversal in a Steiner Triple System
- Optimal packings of bounded degree trees
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Spanning trees in dense graphs
- Spanning trees in random graphs
- Spanning trees in randomly perturbed graphs
- Spanning trees of 3-uniform hypergraphs
- Steiner triple systems without parallel classes
- Subtrees and subforests of graphs
- The probabilistic method
- Universality for bounded degree spanning trees in randomly perturbed graphs
This page was built for publication: A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6603918)
