Random embeddings of bounded-degree trees with optimal spread
From MaRDI portal
Cites work
- A general approach to transversal versions of Dirac‐type theorems
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A proof of the Kahn–Kalai conjecture
- Are many small sets explicitly small?
- Counting oriented trees in digraphs with large minimum semidegree
- Dirac-type conditions for spanning bounded-degree hypertrees
- Embedding loose spanning trees in 3-uniform hypergraphs
- Graph colouring and the probabilistic method
- Hamiltonian cycles in Dirac graphs
- On the number of Hamiltonian cycles in Dirac graphs
- Optimal spread for spanning subgraphs of Dirac hypergraphs
- Proof of a Packing Conjecture of Bollobás
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Robust Hamiltonicity of Dirac graphs
- Robustness of graph properties
- Some Theorems on Abstract Graphs
- Spanning trees in dense directed graphs
- Spanning trees in dense graphs
- Spanning trees in random graphs
- Thresholds and Expectation Thresholds
- Thresholds versus fractional expectation-thresholds
- Transversal factors and spanning trees
This page was built for publication: Random embeddings of bounded-degree trees with optimal spread
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303679)