๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph

โœ Scribed by Karpov, D. V.

Book ID
121571422
Publisher
Springer US
Year
2014
Tongue
English
Weight
348 KB
Volume
196
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An upper bound on the number of cliques
An upper bound on the number of cliques in a graph
โœ Martin Farber; Mihรกly Hujter; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 1 views
An upper bound on the number of edges of
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
โœ Lian-ying Miao; Shi-you Pang; Jian-liang Wu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ยฟ (11 + โˆš 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ยฟ 8 and |V (G)| ยฟ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.