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
Almost all trees are almost graceful
Anna Adamaszek, Peter Allen, Codrut Grosu +1
The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that t…
Komlós's tiling theorem via graphon covers
Jan Hladký, Ping Hu, Diana Piguet
Komlos [Komlos: Tiling Turan Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum-degree condition for covering a given proportion of vertices of a host gra…
Matching polytons
Martin Dolezal, Jan Hladky
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding noti…