30 citations · 114 across the 29 of their papers we have counts for
4 papers · 2 filters
Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs
Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz +1
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp…
Embedding into bipartite graphs
Julia Böttcher, Peter Christian Heinig, Anusch Taraz
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any , every balanced bipartite gra…
Filling the gap between Turán's theorem and Pósa's conjecture
Peter Allen, Julia Böttcher, Jan Hladký
Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (Turan-type results) or on finding spanning subgraphs (Dirac-type results). I…
The tripartite Ramsey number for trees
Julia Böttcher, Jan Hladky, Diana Piguet
We prove that for all epsilon>0 there are c>0 and n_0 such that for all n>n_0 the following holds. For any two-colouring of the edges of one colour contains copies of a…