✦ LIBER ✦

Note making aK4-free graph bipartite

✍ Scribed by Benny Sudakov

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 177 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-2238-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

A Note on the Domination Number of a Bip

A Note on the Domination Number of a Bipartite Graph

✍ J. Harant; A. Pruchnewski 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 61 KB

A note on minimal order of a bipartite g

A note on minimal order of a bipartite graph with exactly q quadrilaterals

✍ Mariusz Woźniak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 206 KB

note on minimal order of a bipartite graph with exactly 4 quadrilaterals, Discrete Mathematics 121 (1993) 229-233. We show that the minimal order of a bipartite graph having exactly 4 quadrilaterals is asymptotically equal to 2fl $j (as 4 tends to infinity).

Tight upper bound on the number of edges

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

✍ Zhi-Zhong Chen; Shiqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo