Graph products and monochromatic multiplicities

Combinatorica

Volumn 17, Issue 1, 1997, Pages 125-134

  Thomason, Andrew ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031473964     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01196136     Document Type: Article

References (13)

1. S. A. BURR, and V. ROSTA: On the Ramsey multiplicities of graph problems and recent results, J. Graph Theory 4 (1980), 347-361.
2. P. ERDOS: On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hung. Acad. Sci., VII, Ser. A3 (1962), 459-464.
3. 4 subgraphs, Discrete Mathematics 114 (1993), 199-203.
4. G. GIRAUD: Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, J. Combin. Theory Ser. B 27 (1979), 237-253.
5. A. W. GOODMAN: On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778-783.
6. C. N. JAGGER: PhD thesis, Cambridge (1995).
7. C. N. JAGGER, P. ŠŤOVÍČEK, and A. THOMASON: Multiplicities of Subgraphs, Combinatorica 16 (1996), 123-141.
8. G. LORDEN: Blue-empty chromatic graphs, Amer. Math. Monthly 69 (1962), 114-120.
9. B. D. MCKAY: Nauty Users Guide (version 1.5), Tech. Rpt. TR-CS-90-02, Dept. Computer Science, Austral. Nat. Univ. (1990).
10. B. D. MCKAY, and G. F. ROYLE: The transitive graphs with at most 26 vertices, Ars Combinatoria 30 (1990), 161-176.
11. A. F. SIDORENKO: Cycles in graphs and functional inequalities, Mathematical Notes 46 (1989), 877-882.
12. A. F. SIDORENKO: Extremal problems for finite sets, Bolyai Society Mathematical Studies 3 (1994), 425-457.
13. A. G. THOMASON: A disproof of a conjecture of Erdos in Ramsey Theory, J. London Math. Soc. 39 (2) (1989), 246-255.