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
4 papers · 2 filters
The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result
Jan Hladký, János Komlós, Diana Piguet +3
This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every there exists a number~ such th…
The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs
Jan Hladky, Diana Piguet, Miklos Simonovits +2
Loebl, Komlós and Sós conjectured that every -vertex graph with at least vertices of degree at least contains each tree of order as a subgraph. We give a…
An approximate version of the Tree Packing Conjecture
Julia Böttcher, Jan Hladký, Diana Piguet +1
We prove that for any pair of constants and and for sufficiently large, every family of trees of orders at most , maximum degrees at most , and with at most $\b…
A density Corrádi-Hajnal Theorem
Peter Allen, Julia Böttcher, Jan Hladký +1
We find, for all sufficiently large and each , the maximum number of edges in an -vertex graph which does not contain vertex-disjoint triangles. This extends a resu…