A spanning bandwidth theorem in random graphs

DOI10.1017/S0963548321000481MaRDI QIDQ5886335zbMATH OpenOpenAlexFDO

Authors

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.03958

zbMATH Keywords

random graphsspanning subgraphssparse regularity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The bandwidth theorem in sparse graphs
• Bandwidth theorem for random graphs
• The bandwidth theorem for locally dense graphs
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Embedding spanning subgraphs of small bandwidth

Cites work

• Blow-up lemma
• Dirac's theorem for random graphs
• Embedding large subgraphs into dense graphs
• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Large-scale structures in random graphs
• Powers of Hamilton cycles in pseudorandom graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Some Theorems on Abstract Graphs
• Szemerédi's regularity Lemma for matrices and sparse graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The bandwidth theorem in sparse graphs
• Triangle resilience of the square of a Hamilton cycle in random graphs

Cited in

(8)

• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Local resilience of spanning subgraphs in sparse random graphs
• scientific article; zbMATH DE number 867648 (Why is no real title available?)
• The bandwidth theorem in sparse graphs
• The bandwidth theorem for locally dense graphs
• Bandwidth theorem for random graphs
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós

This page was built for publication: A spanning bandwidth theorem in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886335)