863 citations
- Centre National de la Recherche ScientifiqueFR211 papers
- Joint Institute for Nuclear ResearchRU206 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR186 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR185 papers
- CEA Paris-SaclayFR182 papers
- Korea UniversityKR166 papers
- Universidade do Estado do Rio de JaneiroBR163 papers
- Lyon 1 UniversitéFR161 papers
- University of California, RiversideUS157 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ155 papers
- Florida State UniversityUS154 papers
- Institute for High Energy PhysicsES153 papers
6 papers · 2 filters
Segment representation of a subclass of co-planar graphs
Mathew C. Francis, Jan Kratochvíl, Tomáš Vyskočil
A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their correspondin…
A counterexample to Wegner's conjecture on good covers
Martin Tancer
In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such tha…
Multi-latin squares
Nicholas Cavenagh, Carlo Hamalainen, James G. Lefevre +1
A multi-latin square of order and index is an array of multisets, each of cardinality , such that each symbol from a fixed set of size occurs times i…
The number of unit distances is almost linear for most norms
Jiří Matoušek
We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the…
On the nonexistence of k-reptile tetrahedra
Jiří Matoušek, Zuzana Safernová
A d-dimensional simplex S is called a k-reptile if it can be tiled without overlaps by simplices S_1,S_2,...,S_k that are all congruent and similar to S. For d=2, k-reptile simplic…
Spanning trees of 3-uniform hypergraphs
Andrew Goodall, Anna de Mier
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a c…