Spanning Trees in Dense Graphs
From MaRDI portal
Publication:2777891
DOI10.1017/S0963548301004849zbMath0998.05012MaRDI QIDQ2777891
Endre Szemerédi, János Komlós, Gábor N. Sárközy
Publication date: 17 September 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
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