Graphs without cycles of even length (Q2730742)
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: Graphs without cycles of even length |
scientific article; zbMATH DE number 1624938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs without cycles of even length |
scientific article; zbMATH DE number 1624938 |
Statements
Graphs without cycles of even length (English)
0 references
29 July 2001
0 references
bipartite graph
0 references
cycle
0 references
The author proves that a bipartite graph with vertex partition of sizes \(M\), \(N\) which has no cycle of length less than or equal to \(2(2k+ 1)\), where \(k\) is a positive integer, has at most \((MN)^{(k+ 1)/(2k+ 1)}+ D_k(N+ M)\) edges, where \(D_k\) only depends on \(k\).
0 references
