Search the dblp DataBase

Publications of Author

1. 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:61-91 [Journal]
   
2. 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:245-268 [Journal]
   
3. Brendan Nagle, Vojtech Rödl, Mathias Schacht
   The counting lemma for regular k-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:28, n:2, pp:113-179 [Journal]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   ICALP, 2007, pp:789-800 [Conf]
   
5. Julia Böttcher, Mathias Schacht, Anusch Taraz
   On the bandwidth conjecture for 3-colourable graphs. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:618-626 [Conf]
   
6. Vojtech Rödl, Mathias Schacht
   Property testing in hypergraphs and the removal lemma. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:488-495 [Conf]
   
7. Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan
   Turán's theorem for pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2007, v:114, n:4, pp:631-657 [Journal]
   
8. 
   Almost all hypergraphs without Fano planes are bipartite. [Citation Graph (, )][DBLP]
   
   
9. 
   Hypergraph regularity and quasi-randomness. [Citation Graph (, )][DBLP]
   
   
10. 
    Obfuscated Drawings of Planar Graphs [Citation Graph (, )][DBLP]
    
    
11. 
    Regular Partitions of Hypergraphs: Counting Lemmas. [Citation Graph (, )][DBLP]
    
    
12. 
    Regular Partitions of Hypergraphs: Regularity Lemmas. [Citation Graph (, )][DBLP]
    
    
13. 
    On Colourings of Hypergraphs Without Monochromatic Fano Planes. [Citation Graph (, )][DBLP]
    
    
14. 
    Note on the 3-graph counting lemma. [Citation Graph (, )][DBLP]