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
Big Ramsey degrees using parameter spaces
Jan Hubička
We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson the…
On the number of quadratic orthomorphisms that produce maximally nonassociative quasigroups
Aleš Drápal, Ian M. Wanless
Let be an odd prime power and suppose that are such that and are nonzero squares. Let be the quasigroup…
Many flows in the group connectivity setting
Matt DeVos, Rikke Langhede, Bojan Mohar +1
Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}…
List homomorphism problems for signed trees
Jan Bok, Richard Brewster, Tomás Feder +2
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $…
Effective formulas for linear recurrence sequences of integers
Martin Klazar
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has…
Fillings of skew shapes avoiding diagonal patterns
Vít Jelínek, Mark Karpilovskij
A skew shape is the difference of two top-left justified Ferrers shapes sharing the same top-left corner. We study integer fillings of skew shapes. As our first main result, we sho…
On flips in planar matchings
Marcel Milich, Torsten Mütze, Martin Pergel
In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on…
Notes on Graph Product Structure Theory
Zdeněk Dvořák, Tony Huynh, Gwenaël Joret +2
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result f…