325 citations
- B. Åsman8 profiles64 · h 98
- A. Sopczak2 profiles63 · h 83
- L. Mundim2 profiles62 · h 124
- M. Begalli5 profiles62 · h 68
- M. Besançon2 profiles62 · h 132
- Y. Arnoud2 profiles62
- D. Wicke4 profiles61 · h 64
- P. Verdier2 profiles61 · h 114
- P. Jonsson9 profiles60
- D. Schaile8 profiles55 · h 87
- C. Bélanger-Champagne2 profiles50
- C. Royon7 profiles50 · h 96
- Joint Institute for Nuclear ResearchRU76 papers
- Centre National de la Recherche ScientifiqueFR70 papers
- Iowa State UniversityUS67 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR65 papers
- CEA Paris-SaclayFR64 papers
- Lancaster UniversityGB63 papers
- Lund UniversitySE63 papers
- Lyon 1 UniversitéFR63 papers
- Universidade do Estado do Rio de JaneiroBR63 papers
- University of WuppertalDE63 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR61 papers
- Czech Technical University in PragueCZ59 papers
Showing 2007 · math.COShow all
3 papers · 2 filters
math.CO2007
Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
Marcos Kiwi, Martin Loebl
We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size…
math.CO2007★ 1 cited
Latin bitrades derived from groups
Nicholas J. Cavenagh, Ales Drapal, Carlo Hamalainen
A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entr…
math.CO2007★ 1 cited
Graph coloring with no large monochromatic components
N. Linial, J. Matousek, O. Sheffet +1
For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having…