Turán and ramsey properties of subcube intersection graphs

Combinatorics Probability and Computing

Volumn 22, Issue 1, 2013, Pages 55-70

  Johnson, J Robert ^a   Markström, Klas ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL STRUCTURES; EDGE DENSITIES; FREE GRAPHS; INTERSECTION GRAPH; LOWER LIMITS; N-VERTEX GRAPH; NON-EMPTY INTERSECTIONS; RAMSEY NUMBERS;

COMPUTER SCIENCE; PROBABILITY;

GRAPH THEORY;

EID: 84870942596     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548312000429     Document Type: Article

References (20)

1. Ajtai, M. Komlós, J. and Szemerédi, E. (1980) A note on Ramsey numbers. J. Combin. Theory Ser. A 29 354-360.
2. Berg, D. E., Norine, S., Su, F. E., Thomas, R. and Wollan, P. (2010) Voting in agreeable societies. Amer. Math. Monthly 117 27-39.
3. Bohman, T. and Keevash, P. (2010) The early evolution of the H-free process. Invent. Math. 181 291- 336.
4. Bollobás, B. (1998) Modern Graph Theory, Vol. 184 of Graduate Texts in Mathematics, Springer.
5. Dénes, J. and Keedwell, A. D. (1974) Latin Squares and their Applications, Academic.
6. Eckhoff, E. (1988) Intersection properties of boxes I: An upper-bound theorem. Israel J. Math. 62 283-301.
7. Erdos, P., Goodman, A. W. and Pósa, L. (1966) The representation of a graph by set intersections. Canad. J. Math. 18 106-112.
8. Erdos, P. and Simonovits, M. (1983) Supersaturated graphs and hypergraphs. Combinatorica 3 181- 192.
9. Graham, R. L., Rothschild, B. L. and Spencer, J. H. (1990) Ramsey Theory, second edition, Wiley-Interscience Series in Discrete Mathematics and Optimization.
10. Jukna, S. and Kulikov, A. S. (2009) On covering graphs by complete bipartite subgraphs. Discrete Math. 309 3399-3403.
11. Kalai, G. (1984) Intersection patterns of convex sets. Israel J. Math. 48 161-174.
12. Karónski, M., Scheinerman, E. R. and Singer-Cohen, K. B. (1999) On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8 131-159. (Pubitemid 129640074)
13. Kim, J. H. (1995) The Ramsey number R(3, t) has order of magnitude t2/ log t. Random Struct. Alg. 7 173-207.
14. McKee, T. A. and McMorris, F. R. (1999) Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications.
15. Nikiforov, V. (2011) The number of cliques in graphs of given order and size. Trans. Amer. Math. Soc. 363 1599-1618.
16. Razborov, A. A. (2008) On the minimal density of triangles in graphs. Combin. Probab. Comput. 17 603-618.
17. Roberts, F. S. (1968) On the boxicity and cubicity of a graph. In Recent Progress in Combinatorics: Proc. Third Waterloo Conference on Combinatorics, Academic, pp. 301-310.
18. Rödl, V. (1985) On a packing and covering problem. Europ. J. Combin. 6 69-78.
19. Spencer, J. (1977) Asymptotic lower bounds for Ramsey functions. Discrete Math. 20 69-76.
20. Tuza, Z. (1984) Covering of graphs by complete bipartite subgraphs: complexity of 0-1 matrices. Combinatorica 4 111-116.