BibSonomy :: author  ::

bookmarks

publications

(68)

• The game chromatic number of random graphs.
  Tom Bohman and Alan M. Frieze and Benny Sudakov Random Struct. Algorithms 32 223-235 (2008)
  to dblp by dblp on 2008-09-08 00:00:00
  | URL | BibTeX  
• How many random edges make a dense hypergraph non-2-colorable?
  Benny Sudakov and Jan Vondrák Random Struct. Algorithms 32 290-306 (2008)
  to dblp by dblp on 2008-09-08 00:00:00
  | URL | BibTeX  
• On the random satisfiable process
  Michael Krivelevich and Benny Sudakov and Dan Vilenchik CoRR abs/0807.4326 (2008)
  to dblp by dblp on 2008-08-04 00:00:00
  | URL | BibTeX  
• Ramsey Numbers and the Size of Graphs.
  Benny Sudakov SIAM J. Discrete Math. 21 980-986 (2007)
  to dblp by dblp on 2008-06-20 00:00:00
  | URL | BibTeX  
• Bounding the Number of Edges in Permutation Graphs.
  Peter Keevash and Po-Shen Loh and Benny Sudakov Electr. J. Comb. 13 (2006)
  to dblp by dblp on 2008-05-25 00:00:00
  | URL | BibTeX  
• H-Free Graphs of Large Minimum Degree.
  Noga Alon and Benny Sudakov Electr. J. Comb. 13 (2006)
  to dblp by dblp on 2008-05-25 00:00:00
  | URL | BibTeX  
• Independent transversals in locally sparse graphs.
  Po-Shen Loh and Benny Sudakov J. Comb. Theory, Ser. B 97 904-918 (2007)
  to dblp by dblp on 2007-09-20 00:00:00
  | URL | BibTeX  
• Induced subgraphs of Ramsey graphs with many distinct degrees.
  Boris Bukh and Benny Sudakov J. Comb. Theory, Ser. B 97 612-619 (2007)
  to dblp by dblp on 2007-09-20 00:00:00
  | URL | BibTeX  
• Learning a Hidden Matching.
  Noga Alon and Richard Beigel and Simon Kasif and Steven Rudich and Benny Sudakov FOCS 197- (2002)
  to dblp by dblp on 2007-07-26 00:00:00
  | URL | BibTeX  
• Note on alternating directed cycles.
  Gregory Gutin and Benny Sudakov and Anders Yeo Discrete Mathematics 191 101-107 (1998)
  to dblp by dblp on 2007-06-19 00:00:00
  | URL | BibTeX