𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes

✍ Scribed by Apfelbaum, Roel; Sharir, Micha

Book ID
118197588
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
244 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interval coloring of (3,4)-biregular bip
Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
✍ A. V. Pyatkin πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 80 KB

## Abstract An interval coloring of a graph is a proper edge coloring such that the set of used colors at every vertex is an interval of integers. Generally, it is an NP‐hard problem to decide whether a graph has an interval coloring or not. A bipartite graph __G__ = (__A__,__B__;__E__) is (Ξ±, Ξ²)‐b

Subdivisions of large complete bipartite
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs
✍ Thomas BΓΆhme; Bojan Mohar; Riste Ε krekovski; Michael Stiebitz πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 67 KB πŸ‘ 1 views

## Abstract It is proved that for every positive integers __k__, __r__ and __s__ there exists an integer __n__ = __n__(__k__,__r__,__s__) such that every __k__‐connected graph of order at least __n__ contains either an induced path of length __s__ or a subdivision of the complete bipartite graph __