424 citations
- Tel Aviv UniversityIL60 papers
- Universidad Andrés BelloCL26 papers
- European Southern ObservatoryCL16 papers
- Pontificia Universidad Católica de ChileCL14 papers
- University of ConcepciónCL14 papers
- Centre National de la Recherche ScientifiqueFR13 papers
- National Institute for AstrophysicsIT11 papers
- Max Planck Institute for AstrophysicsDE8 papers
- Texas A&M UniversityUS8 papers
- University of PotsdamDE8 papers
- Carnegie Institution for ScienceUS7 papers
- Heidelberg UniversityDE7 papers
Showing 2014 · math.COShow all
3 papers · 2 filters
math.CO2014★ 5 cited
Splitting necklaces and measurable colorings of the real line
Noga Alon, Jarosław Grytczuk, Michał Lasoń +1
A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every…
math.CO2014
Waiter-Client and Client-Waiter planarity, colorability and minor games
Dan Hefetz, Michael Krivelevich, Wei En Tan
For a finite set , a family of sets and a positive integer , we consider two types of two player, perfect information games with no chance moves.…
math.CO2014★ 2 cited
Compatible Hamilton cycles in random graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \…