Skip to main content
Home

Turán-Ramsey Theorems and Kp-Independence Numbers

Abstract

Let the Kp-independence number αp (G) of a graph G be the maximum order of an induced subgraph in G that contains no Kp. (So K2-independence number is just the maximum size of an independent set.) For given integers r, p, m > 0 and graphs L1,…,Lr, we define the corresponding Turán-Ramsey function RTp(n, L1,…,Lr, m) to be the maximum number of edges in a graph Gn of order n such that αp(Gn) ≤ m and there is an edge-colouring of G with r colours such that the jth colour class contains no copy of Lj, for j = 1,…, r. In this continuation of [11] and [12], we will investigate the problem where, instead of α(Gn) = o(n), we assume (for some fixed p > 2) the stronger condition that αp(Gn) = o(n). The first part of the paper contains multicoloured Turán-Ramsey theorems for graphs Gn of order n with small Kp-independence number αp(Gn). Some structure theorems are given for the case αp(Gn) = o(n), showing that there are graphs with fairly simple structure that are within o(n2) of the extremal size; the structure is described in terms of the edge densities between certain sets of vertices.

The second part of the paper is devoted to the case r = 1, i.e., to the problem of determining the asymptotic value of

for p < q. Several results are proved, and some other problems and conjectures are stated.

Copyright
References
Hide All
[1]Bollobás, B. (1989) An extension of the isoperimetric inequality on the sphere. Elemente der Math. 44 121124.
[2]Bollobás, B. (1978) Extremal graph theory, Academic Press, London.
[3]Bollobás, B. and Erdős, P. (1976) On a Ramsey-Turán type problem. Journal of Combinatorial Theory B 21 166168.
[4]Brown, W. G., Erdős, P. and Simonovits, M. (1973) Extremal problems for directed graphs. Journal of Combinatorial Theory B 15 (1) 7793.
[5]Brown, W. G., Erdős, P. and Simonovits, M. (1978) On multigraph extremal problems. In: J., Bermond et al. (ed.) Problèmes Combinatoires et Thèorie des Graphes, (Proc. Conf. Orsay 1976), CNRS Paris6366.
[6]Brown, W. G., Erdős, P. and Simonovits, M. (1985) Inverse extremal digraph problems. Finite and Infinite Sets, Eger (Hungary) 1981. Colloq. Math. Soc. J. Bolyai 37, Akad. Kiadó, Budapest119156.
[7]Brown, W. G., Erdős, P. and Simonovits, M. (1985) Algorithmic Solution of Extremal Digraph Problems. Transactions of the American Math Soc. 292/2421449.
[8]Erdős, P. (1968) On some new inequalities concerning extremal properties of graphs. In: Erdős, P. and Katona, G. (ed. ) Theory of Graphs (Proc. Coll. Tihany, Hungary, 1966), Acad. Press N.Y.7781.
[9]Erdős, P. (1961) Graph Theory and Probability, II. Canad. Journal of Math. 13 346352.
[10]Erdős, P. and Hajnal, A. (1966) On chromatic number of graphs and set-systems. Ada Math. Acad. Sci. Hung. 17 6199.
[11]Erdős, P., Hajnal, A., Sós, V. T. and Szemerédi, E. (1983) More results on Ramsey-Turán type problems. Combinatorica 3 (1) 6982.
[12]Erdős, P., Hajnal, A., Simonovits, M, Sós, V. T. and Szemerédi, E. (1993) Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13 3156.
[13]Erdős, P., Meir, A., Sós, V. T. and Turán, P. (1972) On some applications of graph theory I. Discrete Math. 2 (3) 207228.
[14]Erdős, P., Meir, A., Só's, V. T. and Turán, P. (1971) On some applications of graph theory II. Studies in Pure Mathematics (presented to R. Rado), Academic Press, London8999.
[15]Erdős, P., Meir, A., Sós, V. T. and Turán, P. (1972) On some applications of graph theory III. Canadian Math. Bulletin 15 2732.
[16]Erdős, P. and Rogers, C. A. (1962) The construction of certain graphs. Canadian Journal of Math 702707. (Reprinted in Art of Counting, MIT PRESS.)
[17]Erdős, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar. 1 5157.
[18]Erdős, P. and , V. T. (1969) Some remarks on Ramsey's and Turin's theorems. In: Erdős, P. et al. (eds.) Combin. Theory and Appl. Mathem. Coll. Soc. J. Bolyai 4, Balatonfüred395404.
[19]Erdős, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 10891091.
[20]Frankl, P. and Rödl, V. (1988) Some Ramsey-Turán type results for hypergraphs. Combinatorica 8 (4) 323332.
[21]Graham, R. L., Rothschild, B. L. and Spencer, J. (1980) Ramsey Theory, Wiley Interscience, Ser. in Discrete Math.
[22]Katona, G. (1985) Probabilistic inequalities from extremal graph results (a survey). Annals of Discrete Math. 28 159170.
[23]Ramsey, F. P. (1930) On a problem of formal logic. Proc. London Math. Soc, 2nd Series 30 264286.
[24]Shamir, E. (1988) Generalized stability and chromatic numbers of random graphs (preprint, under publication).
[25]Sidorenko, A. F. (1980) Klasszi gipergrafov i verojatnosztynije nyeravensztva, Dokladi 254/3,
[26]Sidorenko, A. F. (1983) (Translation) Extremal estimates of probability measures and their combinatorial nature. Math. USSR - Izv 20 N3 503–533 MR 84d: 60031. (Original: Izvest. Acad. Nauk SSSR. ser. matem. 46 N3 535568.)
[27]Sidorenko, A. F. (1989) Asymptotic solution for a new class of forbidden r-graphs. Combinatorica 9 (2) 207215.
[28]Simonovits, M. (1968) A method for solving extremal problems in graph theory. In: Erdős, P. and Katona, G. (ed.) Theory of Graphs (Proc. Coll. Tihany, Hungary, 1966), Acad. Press N. Y. 279319.
[29]Simonovits, M. (1983) Extremal Graph Theory. In: Beineke, and Wilson, (ed.) Selected Topics in Graph Theory, Academic Press, London, New York, San Francisco161200.
[30]Sós, V. T. (1969) On extremal problems in graph theory. Proc. Calgary International Conf. on Combinatorial Structures and their Application407410.
[31]Szemerédi, E. (1972) On graphs containing no complete subgraphs with 4 vertices (in Hungarian). Mat. Lapok 23 111116.
[32]Szemerédi, E. (1978) On regular partitions of graphs. In: Bermond, J. et al. . (ed.) Problèmes Combinatoires et Théorie des Graphes, (Proc. Conf. Orsay 1976), CNRS Paris 399401.
[33]Turán, P. (1941) On an extremal problem in graph theory (in Hungarian). Matematikai Lapok 48 436452.
[34]Turán, P. (1954) On the theory of graphs. Colloq. Math. 3 1930.
[35]Turán, P. (1969) Applications of graph theory to geometry and potential theory. In: Proc. Calgary International Conf. on Combinatorial Structures and their Application423434.
[36]Turán, P. (1972) Constructive theory of functions. Proc. Internat. Conference in Varna, Bulgaria, 1970, Izdat. Bolgar Akad. Nauk, Sofia.
[37]Turán, P. (1970) A general inequality of potential theory. Proc. Naval Research Laboratory, Washington137141.
[38]Turán, P. (1989) Collected papers of Paul Turán Vol 1–3, Akadé;miai Kiadò, Budapest.
[39]Zykov, A. A. (1949) On some properties of linear complexes. Mat Sbornik 24 163188. (Amer. Math. Soc. Translations 79 (1952)).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
• ISSN: 0963-5483
• EISSN: 1469-2163
• URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Full text viewsFull text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract viewsAbstract views reflect the number of visits to the article landing page.

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed