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
4 papers · 2 filters
On the irreducibility and monodromy of Tutte polynomials
Andrew Goodall, Florent Jouve, Jean-Sébastien Sereni
We study algebraic properties of the Tutte polynomial of a matroid and its generalizations to other combinatorially defined bivariate polynomial invariants. Merino, de Mier and Noy…
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For a positive integer and an ordered set of points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into eq…
Minimum maximal matchings in permutahedra
Sofia Brenner, Jiří Fink, Hung. P. Hoang +2
We prove that the minimal size of a maximal matching in the permutahedron is asymptotically . On the one hand, we obtain a lower bound $M(π_n) \ge n! (n-1) / (…
A note on the computational complexity of weak saturation
Martin Tancer, Mykhaylo Tyomkyn
We prove that determining the weak saturation number of a host graph with respect to a pattern graph is already a computationally hard problem when is the triangle. As…