𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Better bounds for incremental frequency allocation in bipartite graphs

✍ Scribed by Chrobak, Marek; Jeż, Łukasz; Sgall, Jiří

Book ID
123529762
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
382 KB
Volume
514
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Dense Bipartite Graphs of Girth Eight
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point–Line Systems
✍ 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 -