Mathias Schacht

2009
19	EE	Yury Person, Mathias Schacht: Almost all hypergraphs without Fano planes are bipartite. SODA 2009: 217-226
18	EE	Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht: Hypergraph regularity and quasi-randomness. SODA 2009: 227-235
2008
17	EE	Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Obfuscated Drawings of Planar Graphs CoRR abs/0803.0858: (2008)
16	EE	Brendan Nagle, Vojtech Rödl, Mathias Schacht: Note on the 3-graph counting lemma. Discrete Mathematics 308(19): 4501-4517 (2008)
15	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98(4): 752-777 (2008)
2007
14	EE	Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht: Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800
13	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626
12	EE	Vojtech Rödl, Mathias Schacht: Property testing in hypergraphs and the removal lemma. STOC 2007: 488-495
11	EE	Vojtech Rödl, Mathias Schacht: Regular Partitions of Hypergraphs: Regularity Lemmas. Combinatorics, Probability & Computing 16(6): 833-885 (2007)
10	EE	Vojtech Rödl, Mathias Schacht: Regular Partitions of Hypergraphs: Counting Lemmas. Combinatorics, Probability & Computing 16(6): 887-901 (2007)
9	EE	Julia Böttcher, Mathias Schacht, Anusch Taraz: Embedding spanning subgraphs of small bandwidth. Electronic Notes in Discrete Mathematics 29: 485-489 (2007)
8	EE	Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan: Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114(4): 631-657 (2007)
7	EE	Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige: Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97(2): 245-268 (2007)
6	EE	Christian Avart, Vojtech Rödl, Mathias Schacht: Every Monotone 3-Graph Property is Testable. SIAM J. Discrete Math. 21(1): 73-92 (2007)
5	EE	Vojtech Rödl, Andrzej Rucinski, Mathias Schacht: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discrete Math. 21(2): 442-460 (2007)
2006
4	EE	Brendan Nagle, Vojtech Rödl, Mathias Schacht: The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006)
2005
3	EE	Mathias Schacht, Anusch Taraz: Globally bounded local edge colourings of hypergraphs. Electronic Notes in Discrete Mathematics 19: 179-185 (2005)
2	EE	Christian Avart, Vojtech Rödl, Mathias Schacht: Every Monotone 3-Graph Property is Testable. Electronic Notes in Discrete Mathematics 22: 539-542 (2005)
2004
1		Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht: The Turán Theorem for Random Graphs. Combinatorics, Probability & Computing 13(1): 61-91 (2004)

Coauthor Index

1	Noga Alon	[14]
2	Christian Avart	[2] [6]
3	Julia Böttcher	[9] [13] [15]
4	Amin Coja-Oghlan	[14]
5	Hiêp Hàn	[14]
6	Mihyun Kang	[14] [17]
7	Yoshiharu Kohayakawa	[1] [8]
8	Brendan Nagle	[4] [16] [18]
9	Yury Person	[19]
10	Oleg Pikhurko	[17]
11	Annika Poerschke	[18]
12	Alexander Ravsky	[17]
13	Vojtech Rödl	[1] [2] [4] [5] [6] [7] [8] [10] [11] [12] [14] [16] [18]
14	Andrzej Rucinski	[5]
15	Mark H. Siggers	[7]
16	Papa Sissokho	[8]
17	Jozef Skokan	[8]
18	Anusch Taraz	[3] [9] [13] [15]
19	Norihide Tokushige	[7]
20	Oleg Verbitsky	[17]

Colors in the list of coauthors