1.5k citations
- S. Malik4 profiles100 · h 96
- C. Paus11 profiles83 · h 123
- L. Brigliadori7 profiles83 · h 111
- G. Giurgiu6 profiles82 · h 87
- J. Cuevas4 profiles82 · h 118
- M. Goncharov5 profiles82 · h 121
- M. Jones19 profiles82 · h 86
- M. Paulini2 profiles82 · h 123
- A. Beretvas8 profiles81 · h 121
- A. Bhatti8 profiles81 · h 101
- A. Bocci11 profiles81 · h 151
- A. Bodek2 profiles81 · h 131
- Massachusetts Institute of TechnologyUS116 papers
- Purdue University West LafayetteUS110 papers
- Wayne State UniversityUS108 papers
- The Ohio State UniversityUS106 papers
- University of California, DavisUS106 papers
- University of California, Los AngelesUS106 papers
- Texas A&M UniversityUS104 papers
- Institute for High Energy PhysicsES91 papers
- University of FloridaUS91 papers
- University of RochesterUS91 papers
- Joint Institute for Nuclear ResearchRU90 papers
- Argonne National LaboratoryUS87 papers
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
In this note, we determine the maximum number of edges of a -uniform hypergraph, , with a unique perfect matching. This settles a conjecture proposed by Snevily.
math.CO2011
Covering the edges of a random graph by cliques
Alan Frieze, Bruce Reed
The clique cover number of a graph G is the minimum number of cliques required to cover the edges of graph G. In this paper we consider the random graph G(n,p), for p constant. We…