Spanning Trees in Dense Graphs

DOI10.1017/S0963548301004849zbMath0998.05012OpenAlexW2131611659MaRDI QIDQ2777891

János Komlós, Endre Szemerédi, Gábor N. Sárközy

Publication date: 17 September 2002

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

Full work available at URL: https://doi.org/10.1017/s0963548301004849

zbMATH Keywords

regularity lemmablow-up lemma

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Spanning trees of dense directed graphs, Bandwidth, treewidth, separators, expansion, and universality, Spanning trees in dense directed graphs, Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result, Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result, Bounded-Degree Spanning Trees in Randomly Perturbed Graphs, Dirac-type conditions for spanning bounded-degree hypertrees, Tree decompositions of graphs without large bipartite holes, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, A blow-up lemma for approximate decompositions, On embedding well-separable graphs, Proof of the bandwidth conjecture of Bollobás and Komlós, Random perturbation of sparse graphs, Spanning embeddings of arrangeable graphs with sublinear bandwidth, Universality for bounded degree spanning trees in randomly perturbed graphs, Degree Conditions for Embedding Trees, Unnamed Item, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, Transversal factors and spanning trees, On the bipartite graph packing problem