Mader’s Conjecture On Extremely Critical Graphs |
| |
| Authors: | Dr Matthias Kriesell |
| |
| Institution: | 1. Mathematisches Seminar, Universit?t Hamburg, Bundesstra?e 55, D-20146, Hamburg, Germany
|
| |
| Abstract: | A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism).
Here we prove this conjecture. |
| |
| Keywords: | 05C40 05C35 05C75 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
