Andrásfai and Vega graphs in Ramsey–Turán theory
Copyright policy )Andrásfai and Vega graphs in Ramsey–Turán theory
AbstractGiven positive integers , we let denote the maximum number of edges in a triangle‐free graph on vertices with . In the early 1960s, Andrásfai conjectured that for the function is piecewise quadratic with critical values at for . We confirm that this is indeed the case whenever is slightly larger than a critical value, thus determining for all and such that , where .
- Universität Hamburg Germany
Extremal problems in graph theory, Coloring of graphs and hypergraphs, triangle-free graphs, extremal graph theory, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), 05C35, Ramsey-Turán theory
Extremal problems in graph theory, Coloring of graphs and hypergraphs, triangle-free graphs, extremal graph theory, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), 05C35, Ramsey-Turán theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!