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
Showing 2019 · math.COShow all
3 papers · 2 filters
math.CO2019★ 4 cited
Two remarks on graph norms
Frederik Garbe, Jan Hladký, Joonkyung Lee
For a graph , its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions in , , denoted by . One may then…
math.CO2019
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
Martin Doležal, Jan Hladký, Jan Kolář +3
Given a measurable set we consider the "large-distance graph" , on the ground set , in which each pair of points from whose distance is…
math.CO2019★ 10 cited
A limit theorem for small cliques in inhomogeneous random graphs
Jan Hladky, Christos Pelekis, Matas Sileikis
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erdős--Rényi random graph, called -random graphs. We prove, via…