On the Edge Distribution of a Graph

Combinatorics Probability and Computing

Volumn 10, Issue 6, 2001, Pages 543-555

  Nikiforov, V ^a  

^a NONE   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035619135     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548301004837     Document Type: Article

References (9)

1. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
2. Brandt, S. (1998) The local density of triangle-free graphs. Discrete Math. 183 17-25.
3. Chung, F., Graham, R. and Wilson, R. (1989) Quasi-random graphs. Combinatorica 9 345-362.
4. Erdos, P., Faudree, R., Pach, J. and Spencer, J. (1988) How to make a graph bipartite. J. Combin. Theory Ser. B 45 86-98.
5. Erdos, P., Faudree, R., Rousseau, C. and Schelp, R. (1994) A local density condition for triangles. Discrete Math. 127 153-161.
6. Krivelevich, M. (1995) On the edge distribution of triangle-free graphs. J. Combin. Theory Ser. B 63 245-260.
7. Nikiforov, V. Least eigenvalue and local density of a graph. To appear.
8. Rödl, V. (1986) On universality of graphs with uniformly distributed edges. Discrete Math. 59 125-134.
9. Thomason, A. (1987) Pseudo-random graphs. In Random Graphs '85 (M. Karonski and Z. Palka, eds), Ann. Discrete Math. 33 307-331.