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₆-free graph C₄-free and bipartite |
scientific article; zbMATH DE number 6595955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8377545475959778
0 references
0.8358871936798096
0 references
0.8215316534042358
0 references
0.8116341829299927
0 references
0.808896541595459
0 references
