194 citations · 2.2k across the 69 of their papers we have counts for
71 papers
Measurement of lepton-jet correlation in deep-inelastic scattering with the H1 detector using machine learning for unfolding
H1 Collaboration, V. Andreev, M. Arratia +142
The first measurement of lepton-jet momentum imbalance and azimuthal correlation in lepton-proton scattering at high momentum transfer is presented. These data, taken with the H1 d…
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…
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…
Determination of electroweak parameters in polarised deep-inelastic scattering at HERA
H1 Collaboration, H. Spiesberger
The parameters of the electroweak theory are determined in a combined electroweak and QCD analysis using all deep-inelastic and neutral current and charged current sc…
The local limit of the uniform spanning tree on dense graphs
Jan Hladký, Asaf Nachmias, Tuan Tran
Let be a connected graph in which almost all vertices have linear degrees and let be a uniform spanning tree of . For any fixed rooted tree of height we compute…
Determination of the strong coupling constant in next-to-next-to-leading order QCD using H1 jet cross section measurements
H1 collaboration, V. Andreev, A. Baghdasaryan +145
The strong coupling constant is determined from inclusive jet and dijet cross sections in neutral-current deep-inelastic scattering (DIS) measured at HERA by the H1…
Searches for transverse momentum dependent flow vector fluctuations in Pb-Pb and p-Pb collisions at the LHC
ALICE Collaboration
The measurement of azimuthal correlations of charged particles is presented for Pb-Pb collisions at 2.76 TeV and p-Pb collisions at 5.02 T…
Cut-norm and entropy minimization over weak* limits
Martin Dolezal, Jan Hladky
We prove that the accumulation points of a sequence of graphs with respect to the cut-distance are exactly the weak limit points of subsequences of the adj…
Linear and non-linear flow mode in Pb-Pb collisions at 2.76 TeV
ALICE Collaboration
The second and the third order anisotropic flow, and , are mostly determined by the corresponding initial spatial anisotropy coefficients, and $\vare…
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…
Tilings in graphons
Jan Hladky, Ping Hu, Diana Piguet
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons.…
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…
Measurement of Dijet Production in Diffractive Deep-Inelastic Scattering at HERA
Stefan Schmitt
The production of dijets is measured in diffractive deep-inelastic scattering at HERA. The data were recorded with the H1 detector at DESY in the years 2003-2007. Diffractive event…
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…