Small-Subgraph Conditioning is a probabilistic method in combinatorics that analyzes the distribution of random combinatorial structures by conditioning on the counts of small subgraphs to establish asymptotic concentration and limiting behavior.
7
Publications
631
Citations
14
Authors
10
Institutions
Publications per year
2017–2026
0
Parents
Publications
7
1–5 of 7
Authors
14
- AR
2
h-index
- HT
1
h-index
- MA
1
h-index
- IZ
1
h-index
- RS
1
h-index
1–5 of 14
Institutions
10
Adam Mickiewicz University in Poznań
Poznan, Poland
2 h-index
2 publications
197 citations
The University of Melbourne
Melbourne, Australia
1 h-index
1 publications
10 citations
UNSW Sydney
Sydney, Australia
1 h-index
1 publications
26 citations
Institute of Mathematics
Warsaw, Poland
1 h-index
1 publications
171 citations
University of Georgia
Athens, United States
1 h-index
1 publications
10 citations
Uppsala University
Uppsala, Sweden
1 h-index
1 publications
26 citations
ETH Zurich
Zurich, Switzerland
1 h-index
3 publications
69 citations
Temple University
Philadelphia, United States
1 h-index
1 publications
73 citations
1–8 of 10
Venues
- Discrete Mathematics
1 publications · 305 citations
1
h-index
- Random Structures and Algorithms
1 publications · 10 citations
1
h-index
- Combinatorics Probability Computing
1 publications · 26 citations
1
h-index
- Probability Theory and Related Fields
1 publications · 171 citations
1
h-index
- Journal of Fourier Analysis and Applications
1 publications · 73 citations
1
h-index
1–5