Edge-Density Problems is a class of extremal combinatorics questions that seek to determine the maximum or minimum possible density of edges in a graph or hypergraph subject to prescribed structural constraints, distinguishing it from other extremal problems by focusing specifically on quantitative limits of edge distribution rather than vertex or substructure counts.
158
Publications
10.4K
Citations
404
Authors
189
Institutions
Publications per year
2017–2026
23
Parents
Publications
158
Spectral partitioning of random graphs
Frank McSherry · 2001 · 629 citations
Béla Bollobás, P. Erdös · Ars Combinatoria · 1998 · 565 citations
On extremal problems of graphs and generalized graphs
P. Erdös · Israel Journal of Mathematics · 1964 · 449 citations
1–5 of 158
Authors
404
- CR
4
h-index
- PE
4
h-index
- AR
4
h-index
- LS
4
h-index
- KR
3
h-index
1–5 of 404
Institutions
189
Max Planck Institute for Plasma Physics
Garching, Germany
7 h-index
73 publications
3.9K citations
The University of Texas at Austin
Austin, United States
6 h-index
14 publications
733 citations
Eötvös Loránd University
Budapest, Hungary
6 h-index
6 publications
625 citations
University of Cambridge
Cambridge, United Kingdom
5 h-index
6 publications
790 citations
Max Planck Society
Munich, Germany
5 h-index
43 publications
2.4K citations
Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
5 publications
737 citations
University of Oxford
Oxford, United Kingdom
4 h-index
4 publications
145 citations
Universität Hamburg
Hamburg, Germany
4 h-index
6 publications
118 citations
1–8 of 189
Venues
- Discrete Mathematics
13 publications · 431 citations
12
h-index
- Nuclear Fusion
9 publications · 548 citations
9
h-index
- COMBINATORICA
5 publications · 275 citations
5
h-index
- Combinatorics Probability Computing
4 publications · 288 citations
4
h-index
- Journal of Graph Theory
4 publications · 107 citations
4
h-index
1–5