Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Making a \(C_6\)-free graph \(C_4\)-free and bipartite |
scientific article; zbMATH DE number 6595955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Making a \(C_6\)-free graph \(C_4\)-free and bipartite |
scientific article; zbMATH DE number 6595955 |
Statements
Making a \(C_6\)-free graph \(C_4\)-free and bipartite (English)
0 references
21 June 2016
0 references
extremal graphs
0 references
bipartite subgraphs
0 references
6-cycles
0 references
4-cycles
0 references
