978 citations
- F. Šforza48
- B. Stelzer10 profiles37 · h 88
- C. Paus8 profiles34 · h 123
- D. Stentz5 profiles34 · h 39
- F. Azfar3 profiles34 · h 63
- G. Giurgiu4 profiles34 · h 87
- J. Boudreau4 profiles34 · h 107
- J. Cuevas2 profiles34 · h 118
- J. Nielsen2 profiles34 · h 78
- J. Russ3 profiles34 · h 110
- K. Gibson2 profiles34 · h 49
- L. Brigliadori3 profiles34 · h 111
- Massachusetts Institute of TechnologyUS65 papers
- Yale UniversityUS63 papers
- Argonne National LaboratoryUS61 papers
- Purdue University West LafayetteUS59 papers
- Lawrence Berkeley National LaboratoryUS58 papers
- University of California, Los AngelesUS57 papers
- Wayne State UniversityUS57 papers
- University of California, DavisUS56 papers
- Michigan State UniversityUS55 papers
- Texas A&M UniversityUS55 papers
- The Ohio State UniversityUS55 papers
- University of PittsburghUS55 papers
Showing 2003 · math.COShow all
2 papers · 2 filters
math.CO2003★ 3 cited
Dense Edge-Magic Graphs and Thin Additive Bases
Oleg Pikhurko
We study s(k,n), the maximum size of A+A where A is a k-subset of [n]. A few known functions from additive number theory can be expressed via s(k,n). For example, our estimates of…
math.CO2003★ 6 cited
The strong perfect graph conjecture
Gérard Cornuéjols
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line…