Items where Author is "Taraz, Anusch"
Number of items: 16.
Perfectly packing graphs with bounded degeneracy and many leaves. (2022)
Allen, Peter; Böttcher, Julia; Clemens, Dennis; Taraz, Anusch
picture_as_pdf
Almost spanning subgraphs of random graphs after adversarial edge removal.
Böttcher, Julia; Kohayakawa, Yoshiharu; Taraz, Anusch
Almost spanning subgraphs of random graphs after adversarial edge removal.
Böttcher, Julia; Kohayakawa, Yoshiharu; Taraz, Anusch
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Böttcher, Julia; Pruessmann, Klaas P.; Taraz, Anusch; Würfl, Andreas
Bandwidth, treewidth, separators, expansion, and universality.
Böttcher, Julia; Pruessmann, Klaas P.; Taraz, Anusch; Würfl, Andreas
Embedding into bipartite graphs.
Böttcher, Julia; Heinig, Peter; Taraz, Anusch
Local resilience of spanning subgraphs in sparse random graphs.
Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Taraz, Anusch
On the bandwidth conjecture for 3-colourable graphs.
Böttcher, Julia; Schacht, Mathais; Taraz, Anusch
Perfect graphs of fixed density: counting and homogeneous sets.
Böttcher, Julia; Taraz, Anusch; Würfl, Andreas
Proof of the bandwidth conjecture of Bollobás and Komlós.
Böttcher, Julia; Schacht, Mathais; Taraz, Anusch
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
Böttcher, Julia; Schacht, Mathias; Taraz, Anusch
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Böttcher, Julia; Taraz, Anusch; Würfl, Andreas
An approximate version of the tree packing conjecture.
Böttcher, Julia; Hladký, Jan; Piguet, Diana; Taraz, Anusch
The bandwidth theorem in sparse graphs.
Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Taraz, Anusch
picture_as_pdf
An extension of the blow-up lemma to arrangeable graphs.
Böttcher, Julia; Kohayakawa, Yoshiharu; Taraz, Anusch; Würfl, Andreas
A spanning bandwidth theorem in random graphs.
Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Schnitzer, Jakob; Taraz, Anusch
picture_as_pdf