
Search the dblp DataBase
Mathias Schacht:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
The Turán Theorem for Random Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:6191 [Journal]
 Vojtech Rödl, Mathias Schacht, M. H. Siggers, Norihide Tokushige
Integer and fractional packings of hypergraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:2, pp:245268 [Journal]
 Brendan Nagle, Vojtech Rödl, Mathias Schacht
The counting lemma for regular kuniform hypergraphs. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:28, n:2, pp:113179 [Journal]
 Noga Alon, Amin CojaOghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions. [Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:789800 [Conf]
 Julia Böttcher, Mathias Schacht, Anusch Taraz
On the bandwidth conjecture for 3colourable graphs. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:618626 [Conf]
 Vojtech Rödl, Mathias Schacht
Property testing in hypergraphs and the removal lemma. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:488495 [Conf]
 Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan
Turán's theorem for pseudorandom graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2007, v:114, n:4, pp:631657 [Journal]
Almost all hypergraphs without Fano planes are bipartite. [Citation Graph (, )][DBLP]
Hypergraph regularity and quasirandomness. [Citation Graph (, )][DBLP]
Obfuscated Drawings of Planar Graphs [Citation Graph (, )][DBLP]
Regular Partitions of Hypergraphs: Counting Lemmas. [Citation Graph (, )][DBLP]
Regular Partitions of Hypergraphs: Regularity Lemmas. [Citation Graph (, )][DBLP]
On Colourings of Hypergraphs Without Monochromatic Fano Planes. [Citation Graph (, )][DBLP]
Note on the 3graph counting lemma. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
