𝔖 Bobbio Scriptorium
✦   LIBER   ✦

König–Egerváry Graphs are Non-Edmonds

✍ Scribed by P. Mark Kayll

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
121 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Jacobi's identity and the König-Egerváry
Jacobi's identity and the König-Egerváry theorem
✍ Joseph P.S Kung 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 110 KB

The Krnig-Egervkry theorem, which asserts that the maximum size of a partial matching in a relation equals the minimum size of a separating set, is proved using Jacobrs identity relating complementary minors in a matrix and its adjugate.

Large Isaacs' graphs are maximally non-
Large Isaacs' graphs are maximally non- Hamilton-connected
✍ Rafał Kalinowski; Zdzisław Skupień 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 271 KB

saAold ya!dnys '[z] Ja8uyug pue yn.q3 dq UMO~S se u~yo)p~quou ~~.II~X~LU asp are sqde&i asou \*[cl )sa!a uerl pue ualCoa OJ anp pue '(d~~~~~~~~~u~lequou) [p] $inf) 10 [s] SXXSI 0) anp slInsa1 atuos 111013 SMOIIOJ q3!q~ uyuo)lyeqoddq aJt? z e y ~J!M I+Tz[ sqdm% ,sxesI \*(I+ yz olnpow peal aq 01 ale s

Non-Ramsey Graphs Are c log n-
Non-Ramsey Graphs Are c log n-Universal
✍ Hans Jürgen Prömel; Vojtěch Rödl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

We prove that for any c 1 >0 there exists c 2 >0 such that the following statement is true: If G is a graph with n vertices and with the property that neither G nor its complement contains a complete graph K l , where l=c 1 log n then G is c 2 log n-universal, i.e., G contains all subgraphs with c 2