Embedding spanning bounded degree subgraphs in randomly perturbed graphs
From MaRDI portal
Publication:1689904
DOI10.1016/j.endm.2017.06.033zbMath1378.05111arXiv1802.04603OpenAlexW2963973919MaRDI QIDQ1689904
Julia Böttcher, Yury Person, Richard Montgomery, Olaf Parczyk
Publication date: 18 January 2018
Full work available at URL: https://arxiv.org/abs/1802.04603
Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items (7)
Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ 2-universality in randomly perturbed graphs ⋮ Random perturbation of sparse graphs ⋮ The Effect of Adding Randomly Weighted Edges ⋮ Hamiltonicity in randomly perturbed hypergraphs ⋮ Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers ⋮ Isoperimetric numbers of randomly perturbed intersection graphs
Cites Work
- Unnamed Item
- Cycles and matchings in randomly perturbed digraphs and hypergraphs
- Loose Hamilton cycles in random uniform hypergraphs
- Loose Hamilton cycles in hypergraphs
- Embedding nearly-spanning bounded degree trees
- Threshold functions
- Spanning subgraphs of random graphs
- Hamiltonian circuits in random graphs
- Spanning structures and universality in sparse hypergraphs
- Factors in random graphs
- Adding random edges to dense graphs
- Spanning Subgraphs of Random Graphs
- Hall's theorem for hypergraphs
- How many random edges make a dense graph hamiltonian?
- Tight Hamilton cycles in random hypergraphs
- On the existence of a factor of degree one of a connected random graph
This page was built for publication: Embedding spanning bounded degree subgraphs in randomly perturbed graphs
