A few remarks on Ramsey--Turán-type problems (Q1405104): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey-Turán type problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán-Ramsey theorems and simple asymptotically extremal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán-Ramsey Theorems and <i>K<sub>p</sub></i>-Independence Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on Ramsey-Turán type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem for arithmetic progressions of length four / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small Ramsey numbers* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-Turán theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401979 / rank
 
Normal rank

Latest revision as of 09:20, 6 June 2024

scientific article
Language Label Description Also known as
English
A few remarks on Ramsey--Turán-type problems
scientific article

    Statements

    A few remarks on Ramsey--Turán-type problems (English)
    0 references
    25 August 2003
    0 references
    For fixed graph \(H\) and positive integer function \(f(n)\), the Ramsey-Turán number \(\text{RT}(n, H,f(n))\) is the maximum number of edges in a graph \(G\) of order \(n\) without having a copy of \(H\) and without \(f(n)\) independent vertices. Some improved bounds for some Ramsey-Turán numbers are proved. For example, it is shown for \(r > 2\), \(\text{RT}(n, K_4, n^{1 - 1/r}) < n^{2-1/r(r+1)}\). Results such as ``if \(H\) is a graph whose vertices can be partitioned into two sets each inducing an acyclic graph, then \(\text{RT}(n, H, ne^{-\omega(n)\sqrt{\ln n}}) = o(n^2)\), where \(\omega(n) \rightarrow \infty\) arbitrarily slowly with \(n\)'' are proved and used to give bounds for specific graphs.
    0 references
    Ramsey numbers
    0 references
    Turán numbers
    0 references
    0 references

    Identifiers