Spanning structures and universality in sparse hypergraphs
From MaRDI portal
Publication:2953700
DOI10.1002/rsa.20690zbMath1352.05139arXiv1504.02243OpenAlexW2311465632MaRDI QIDQ2953700
Publication date: 5 January 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02243
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items (9)
On rainbow Hamilton cycles in random hypergraphs ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Embedding spanning bounded degree subgraphs in randomly perturbed graphs ⋮ On offset Hamilton cycles in random hypergraphs ⋮ Saturation number of Berge stars in random hypergraphs ⋮ On universal hypergraphs ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamiltonian Berge cycles in random hypergraphs
Cites Work
- Loose Hamilton cycles in random uniform hypergraphs
- Embedding nearly-spanning bounded degree trees
- Loose Hamilton cycles in random 3-uniform hypergraphs
- Threshold functions
- Spanning subgraphs of random graphs
- Hamiltonian circuits in random graphs
- Isometric embeddings into cube-hypergraphs
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- Approximate counting of regular hypergraphs
- Universality of random graphs and rainbow embedding
- Universality of Random Graphs
- Universality of Random Graphs for Graphs of Maximum Degree Two
- Introduction to Random Graphs
- Cycle Factors and Renewal Theory
- Embedding Spanning Trees in Random Graphs
- Sharp threshold for the appearance of certain spanning trees in random graphs
- Thresholds and Expectation Thresholds
- Factors in random graphs
- Spanning Subgraphs of Random Graphs
- On Pósa's Conjecture for Random Graphs
- Expanders Are Universal for the Class of All Spanning Trees
- Tight Hamilton cycles in random uniform hypergraphs
- An improved upper bound on the density of universal random graphs
- Tight Hamilton cycles in random hypergraphs
- Sparse universal graphs for bounded‐degree graphs
- On the existence of a factor of degree one of a connected random graph
- Almost‐spanning universality in random graphs
- The threshold for combs in random graphs
This page was built for publication: Spanning structures and universality in sparse hypergraphs
