On the sizes of bi-k-maximal graphs

Let k , n , s , t > 0 be integers and n = s + t ≥ 2 k + 2 . A simple bipartite graph G spanning K s , t is bi- k -maximal , if every subgraph of G has edge-connectivity at most k but any edge addition that does not break its bipartiteness creates a subgraph with connectivity at least k + 1 . We i...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2020-04, Vol.39 (3), p.859-873
Hauptverfasser:	Xu, Liqiong, Tian, Yingzhi, Lai, Hong-Jian
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Convex and Discrete Geometry Decision trees Graph theory Graphs Integers Lower bounds Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!