194 citations · 2.2k across the 69 of their papers we have counts for
10 papers · 1 filter
Measurement of Dijet Production in Diffractive Deep-Inelastic ep Scattering at HERA
H1 Collaboration
A measurement is presented of single- and double-differential dijet cross sections in diffractive deep-inelastic scattering at HERA using data collected by the H1 experiment c…
The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs
Jan Hladký, János Komlós, Diana Piguet +3
This is the second 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 that…
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-Komlós-Sós Conjecture III: The finer structure of LKS graphs
Jan Hladký, János Komlós, Diana Piguet +3
This is the third 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 that fo…
The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition
Jan Hladký, János Komlós, Diana Piguet +3
In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every there exists a number such that for every every -v…
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…
Measurement of Feynman-x Spectra of Photons and Neutrons in the Very Forward Direction in Deep-Inelastic Scattering at HERA
H1 Collaboration
Measurements of normalised cross sections for the production of photons and neutrons at very small angles with respect to the proton beam direction in deep-inelastic scatterin…
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…
An extension of Turán's Theorem, uniqueness and stability
Peter Allen, Julia Böttcher, Jan Hladký +1
We determine the maximum number of edges of an -vertex graph with the property that none of its -cliques intersects a fixed set . For , the…