10.9k citations
- Massachusetts Institute of TechnologyUS101 papers
- Centre National de la Recherche ScientifiqueFR96 papers
- University of California, BerkeleyUS86 papers
- Weizmann Institute of ScienceIL85 papers
- Heidelberg UniversityDE81 papers
- University of Massachusetts AmherstUS81 papers
- The Ohio State UniversityUS78 papers
- Rutherford Appleton LaboratoryGB77 papers
- Johannes Gutenberg University MainzDE75 papers
- University of British ColumbiaCA75 papers
- California Institute of TechnologyUS74 papers
- McGill UniversityCA74 papers
Showing 2010 · math.COShow all
3 papers · 2 filters
math.CO2010
Fast embedding of spanning trees in biased Maker-Breaker games
Asaf Ferber, Dan Hefetz, Michael Krivelevich
Given a tree on vertices, we consider the Maker-Breaker tree embedding game . The board of this game is the edge set of the complete graph o…
math.CO2010
The number of F-matchings in almost every tree is a zero residue
Noga Alon, Simi Haber, Michael Krivelevich
For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for e…
math.CO2010★ 3 cited
Increasing the chromatic number of a random graph
N. Alon, B. Sudakov
What is the minimum number of edges that have to be added to the random graph in order to increase its chromatic number by one percent ? One possibility is t…