10.9k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR3.6k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR3.2k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR3k papers
- Joint Institute for Nuclear ResearchRU2.7k papers
- Institute for High Energy PhysicsES2.7k papers
- European Organization for Nuclear ResearchCH2.6k papers
- Institut de Recherche sur les Lois Fondamentales de l'UniversFR2.6k papers
- Institute of High Energy PhysicsCN2.6k papers
- Rutherford Appleton LaboratoryGB2.5k papers
- Deutsches Elektronen-Synchrotron DESYDE2.5k papers
- National and Kapodistrian University of AthensGR2.5k papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT2.4k papers
8 papers · 2 filters
Packing coloring of hypercubes with extended Hamming codes
Petr Gregor, Jaka Kranjc, Borut Lužar +1
A {\em packing coloring} of a graph is a mapping assigning a positive integer (a color) to every vertex of such that every two vertices of color are at distance at leas…
Extending simple monotone drawings
Jan Kynčl, Jan Soukup
We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement of -monotone pseudosegments in the plane and a pair of points with d…
The Hierarchy of Hereditary Sorting Operators
Vít Jelínek, Michal Opler, Jakub Pekárek
We consider the following general model of a sorting procedure: we fix a hereditary permutation class , which corresponds to the operations that the procedure is allow…
EPPA numbers of graphs
David Bradley-Williams, Peter J. Cameron, Jan Hubička +1
If is a graph, and its induced subgraphs, and an isomorphism, we say that is a \emph{partial automorphism} of . In 1992, Hrushovski proved that…
Structural convergence and algebraic roots
David Hartman, Tomáš Hons, Jaroslav Nešetřil
Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence.…
Random minimum spanning tree and dense graph limits
Jan Hladký, Gopal Viswanathan
A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph whose edges get independent weights from the distribution $UNIF…
Extremal families for the Kruskal--Katona theorem
Oriol Serra, Lluís Vena
Given a family of --subsets of , its lower shadow is the family of --subsets which are contained in at least one set in . The celebrated Kruskal--Katon…
Triangle Percolation on the Grid
Igor Araujo, Bryce Frederickson, Robert A. Krueger +5
We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set , and then it…