Showing 1–20 of 38 results
/ Date/ Name
Jul 11, 2013Anarchy is free in network creationApr 8, 2013Packing tree factors in random and pseudo-random graphsJan 20, 2009A note on embedding hypertreesJul 31, 2009Ramsey games with giantsJan 17, 2011Stochastic coalescence in logarithmic timeMay 27, 2015Directed paths: from Ramsey to Ruzsa and SzemerédiMay 25, 2010Packing tight Hamilton cycles in 3-uniform hypergraphsApr 14, 2025A cute proof that makes $e$ naturalApr 14, 2010Variations on Cops and RobbersSep 14, 2011Bisections of graphsOct 13, 2019A Simple Proof of the Quadratic FormulaMar 4, 2014Hamiltonian increasing paths in random edge orderingsJul 3, 2015Cops and robbers on planar directed graphsAug 3, 2007Avoiding small subgraphs in Achlioptas processesJan 4, 2012Self-similarity of graphsJul 27, 2011The size of a hypergraph and its matching numberDec 31, 2010Rainbow Hamilton cycles in random graphsNov 2, 2012Computing with voting treesNov 17, 2008Maximizing the number of q-coloringsJul 2, 2019Minimizing the numbers of cliques and cycles of fixed size in an $F$-saturated graph