How unproportional must a graph be?
- 1 October 2018
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 73, 138-152
Abstract
No abstract availableAll Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/K012045/1, 306493)
- National Science Foundation (EP/K012045/1, 306493)
- American Institute of Mathematics (EP/K012045/1, 306493)
- European Research Council (EP/K012045/1, 306493)
This publication has 14 references indexed in Scilit:
- Weak quasi‐randomness for uniform hypergraphsRandom Structures & Algorithms, 2011
- Intersections of graphsJournal of Graph Theory, 2011
- A graph Fourier transform and proportional graphsRandom Structures & Algorithms, 1995
- Probabilistic construction of proportional graphsRandom Structures & Algorithms, 1992
- The asymptotic distributions of generalized U-statistics with applications to random graphsProbability Theory and Related Fields, 1991
- Proportional graphsRandom Structures & Algorithms, 1991
- A functional limit theorem for random graphs with applications to subgraph count statisticsRandom Structures & Algorithms, 1990
- Quasi-random graphsCombinatorica, 1989
- Cutting a graph into two dissimilar halvesJournal of Graph Theory, 1988
- Imbalances in k‐colorationsNetworks, 1971