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 2017 · math.COShow all
3 papers · 2 filters
math.CO2017★ 1 cited
The random k-matching-free process
Michael Krivelevich, Matthew Kwan, Po-Shen Loh +1
Let be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty -vertex graph and then adds edges…
math.CO2017★ 1 cited
Finding and using expanders in locally sparse graphs
Michael Krivelevich
We show that every locally sparse graph contains a linearly sized expanding subgraph. For constants , , a graph on vertices is called a -grap…
math.CO2017
A Note on the Minimum Number of Edges in Hypergraphs with Property O
Gal Kronenberg, Christopher Kusch, Ander Lamaison +2
An oriented -uniform hypergraph is said to have Property O if for every linear order of the vertex set, there is some edge oriented consistently with the linear order. Recently…