216 citations
- University of CambridgeGB10 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- University of OxfordGB3 papers
- ETH ZurichCH2 papers
- Queen Mary University of LondonGB2 papers
- Universidade de São PauloBR2 papers
- University of LondonGB2 papers
- University of Southern CaliforniaUS2 papers
- Amsterdam University CollegeNL1 paper
- Amsterdam University of Applied SciencesNL1 paper
- Arizona State UniversityUS1 paper
- Benemérita Universidad Autónoma de PueblaMX1 paper
4 papers · 1 filter
On the sum of the largest and smallest eigenvalues of graphs with high odd girth
Fredy Yip
The sum of the maximum and minimum eigenvalues, and the odd girth of a graph both measure bipartiteness. We seek to relate these measures. In particular, for an odd int…
Counting orientations of random graphs with no directed k-cycles
Marcelo Campos, Maurício Collares, Guilherme Oliveira Mota
For every , we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph containing no directed cycle of le…
On the number of monotone sequences
Wojciech Samotij, Benny Sudakov
One of the most classical results in Ramsey theory is the theorem of Erdős and Szekeres from 1935, which says that every sequence of more than numbers contains a monotone sub…
Optimal packings of Hamilton cycles in sparse random graphs
Michael Krivelevich, Wojciech Samotij
We prove that there exists a positive constant εsuch that if \log n / n \le p \le n^{-1+ε}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \…