Spanning trees in dense graphs

DOI10.1017/S0963548301004849MaRDI QIDQ2777891zbMATH OpenOpenAlexFDO

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

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

blow-up lemmaregularity lemma

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees in dense directed graphs
• Spanning trees in random graphs
• Spanning trees in randomly perturbed graphs
• Almost-spanning subgraphs with bounded degree in dense graphs
• Local resilience of almost spanning trees in random graphs

Cited in

(40)

• Spanning trees in multipartite geometric graphs
• Star-factors in graphs with large minimum degree
• Random perturbation of sparse graphs
• Emerging spanning trees in the work of Candilis-Josic-Woods
• Spanning trees of dense directed graphs
• On the bipartite graph packing problem
• Spanning trees in dense directed graphs
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Embedding large subgraphs into dense graphs
• A blow-up lemma for approximate decompositions
• Tree decompositions of graphs without large bipartite holes
• Universality for bounded degree spanning trees in randomly perturbed graphs
• An edge-swap heuristic for finding dense spanning trees
• Degree conditions for embedding trees
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• Bandwidth, treewidth, separators, expansion, and universality
• Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
• Expanders are universal for the class of all spanning trees
• Transversal factors and spanning trees
• 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
• Dirac-type conditions for spanning bounded-degree hypertrees
• Embedding loose spanning trees in 3-uniform hypergraphs
• Counting oriented trees in digraphs with large minimum semidegree
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
• Spanning trees in graphs without large bipartite holes
• Counting spanning subgraphs in dense hypergraphs
• Stability of transversal Hamilton cycles and paths
• Transversal panconnectedness in graph collections
• Creating spanning trees in Waiter-Client games
• Packing large balanced trees into bipartite graphs
• Dirac's theorem for linear hypergraphs
• Randomly perturbed digraphs also have bounded-degree spanning trees
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• On embedding well-separable graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós

This page was built for publication: Spanning trees in dense graphs

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