On a Turán type problem of Erdős (Q1180412): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3313888 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some extremal problems in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5520566 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of linear graphs / rank | |||
Normal rank |
Latest revision as of 14:01, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a Turán type problem of Erdős |
scientific article |
Statements
On a Turán type problem of Erdős (English)
0 references
27 June 1992
0 references
For a given graph \(F\) are presented upper and lower bounds for the maximum number of edges of a graph with \(n\) vertices not containing \(F\) as a subgraph. Extracted are the cases when \(F\) is a kind of bipartite graph. The cases permitting exact values of this variable the author is going to publish separately. The article mentions that the problem is connected with the problem of the determination of the chromatic number of \(F\).
0 references
problem of Erdős
0 references
Turán problem
0 references
bounds
0 references
chromatic number
0 references