9.8k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Czech Academy of SciencesCZ288 papers
- Institute of Mathematics and InformaticsBG134 papers
- Charles UniversityCZ114 papers
- Centre National de la Recherche ScientifiqueFR46 papers
- Institute of MathematicsPL46 papers
- Romanian AcademyRO43 papers
- Polish Academy of SciencesPL41 papers
- University of WarsawPL37 papers
- University of CambridgeGB31 papers
- Sapienza University of RomeIT30 papers
- University of PaduaIT30 papers
- Université Paris CitéFR29 papers
3 papers · 2 filters
Chromatic roots and limits of dense graphs
Peter Csikvari, Peter E. Frenkel, Jan Hladky +1
In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…
Cliques in dense inhomogeneous random graphs
Martin Doležal, Jan Hladký, András Máthé
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…
Upper bound theorem for odd-dimensional flag triangulations of manifolds
Michal Adamaszek, Jan Hladký
We prove that among all flag triangulations of manifolds of odd dimension 2r-1 with sufficiently many vertices the unique maximizer of the entries of the f-, h-, g- and gamma-vecto…