10.9k citations
- Massachusetts Institute of TechnologyUS116 papers
- Centre National de la Recherche ScientifiqueFR108 papers
- University of California, BerkeleyUS96 papers
- Weizmann Institute of ScienceIL95 papers
- Heidelberg UniversityDE92 papers
- University of Massachusetts AmherstUS90 papers
- Rutherford Appleton LaboratoryGB89 papers
- The Ohio State UniversityUS88 papers
- Université Paris CitéFR87 papers
- Johannes Gutenberg University MainzDE86 papers
- Université Paris-SudFR86 papers
- University of British ColumbiaCA86 papers
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013★ 4 cited
Deterministic vs Non-deterministic Graph Property Testing
Lior Gishboliner, Asaf Shapira
A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-determinist…
math.CO2013
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Let , , and be integers satisfying . A Steiner system with parameters , , and is a -uniform hypergraph on vertices in which every set of d…
math.CO2013
Crossings in Grid Drawings
Vida Dujmovic, Pat Morin, Adam Sheffer
We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting…