On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4830805 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximal number of induced complete bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5724802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of a theorem of Turán / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
Revision as of 09:50, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the maximal number of certain subgraphs in \(K_ r\)-free graphs |
scientific article |
Statements
On the maximal number of certain subgraphs in \(K_ r\)-free graphs (English)
0 references
25 June 1992
0 references
triangle-free graph
0 references
colour classes
0 references
\(K_ r\)-free graph
0 references
