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

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

โœ Scribed by Eyal Ackerman

Publisher
Springer
Year
2009
Tongue
English
Weight
579 KB
Volume
41
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
โœ R.J. Faudree; J. Sheehan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

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.

On the maximum number of edges in a hype
On the maximum number of edges in a hypergraph whose linegraph contains no cycle
โœ J.-C. Bermond; P. Frankl; F. Sterboul ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 122 KB

Soit H = (X. ~1 un hypergraphe h-uniforme avec IX] = net soit L h ~(H! le graphe Jont les sommets reprdsentent les arates de H, deux sommets 6lant reli6s si et seulement si t~s z~r6tes qu'ils reprdsen!ent intersectent en h -1 sommet,=. Nous montrons que sif,, t(H) ne contienl pas de cycle, alors I~[