648 citations
- B. Åsman9 profiles94 · h 98
- A. Sopczak2 profiles93 · h 83
- D. Schaile9 profiles92 · h 87
- L. Mundim2 profiles92 · h 124
- M. Begalli5 profiles92 · h 68
- M. Besançon2 profiles92 · h 132
- Y. Arnoud2 profiles92
- D. Wicke5 profiles91 · h 64
- P. Verdier2 profiles91 · h 114
- P. Jonsson9 profiles87
- K. M. Chan2 profiles80
- A. Meyer3 profiles78 · h 142
- Joint Institute for Nuclear ResearchRU122 papers
- Centre National de la Recherche ScientifiqueFR112 papers
- Iowa State UniversityUS105 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR104 papers
- Lund UniversitySE103 papers
- CEA Paris-SaclayFR102 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR99 papers
- Czech Technical University in PragueCZ98 papers
- Lancaster UniversityGB93 papers
- Lyon 1 UniversitéFR93 papers
- Universidade do Estado do Rio de JaneiroBR93 papers
- University of WuppertalDE93 papers
Showing 2009 · math.COShow all
4 papers · 2 filters
math.CO2009
Non-representability of finite projective planes by convex sets
Martin Tancer
We prove that there is no d such that all finite projective planes can be represented by convex sets in R^d, answering a question of Alon, Kalai, Matousek, and Meshulam. Here, if P…
math.CO2009★ 1 cited
Latin bitrades, dissections of equilateral triangles and abelian groups
Ales Drapal, Carlo Hamalainen, Viteslav Kala
Let be a spherical latin bitrade. With each associate a set of linear equatio…
math.CO2009
Domination number of cubic graphs with large girth
Daniel Kral, Petr Skoda, Jan Volec
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).
math.CO2009
Graphs with bounded tree-width and large odd-girth are almost bipartite
Alexandr V. Kostochka, Daniel Kral', Jean-Sebastien Sereni +1
We prove that for every and every , there exists such that every graph with tree-width at most and odd-girth at least has circular chromatic number a…