( en | de | ru )

 

Disambiguation of "Böttcher, Julia"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Cycles in Hypergraphs.

, , , and . Electron. Notes Discret. Math., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Julia Böttcher

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Guenter Julian

Otto Julian

Ernst Julian

 

Other publications of authors with the same name

The tripartite Ramsey number for trees., , and . J. Graph Theory, 69 (3): 264-300 (2012)An Extension of the Blow-up Lemma to Arrangeable Graphs., , , and . SIAM J. Discret. Math., 29 (2): 962-1001 (2015)Embedding spanning subgraphs of small bandwidth., , and . Electron. Notes Discret. Math., (2007)Almost spanning subgraphs of random graphs after adversarial edge removal., , and . Electron. Notes Discret. Math., (2009)Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time.. MFCS, volume 3618 of Lecture Notes in Computer Science, page 156-167. Springer, (2005)Spanning embeddings of arrangeable graphs with sublinear bandwidth., , and . Random Struct. Algorithms, 48 (2): 270-289 (2016)Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs., , , and . Eur. J. Comb., 31 (5): 1217-1227 (2010)Properly coloured copies and rainbow copies of large graphs with small maximum degree., , and . Random Struct. Algorithms, 40 (4): 425-436 (2012)An improved error term for minimum H-decompositions of graphs., , and . J. Comb. Theory, Ser. B, (2014)Tight cycles and regular slices in dense hypergraphs., , , and . J. Comb. Theory, Ser. A, (2017)