On Dense Bipartite Graphs of Girth Eight
✍
D de Caen; L.A Székely
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 956 KB
In earlier work we showed that if G(m, n) is a bipartite graph with no 4-cycles or 6-cycles, and if m<c 1 n 2 and n<c 2 m 2 , then the number of edges e is O((mn) 2Â3 ). Here we give a more streamlined proof, obtaining some sharp results; for example, if G has minimum degree at least two then e 3 -