A short proof of the wonderful lemma

被引：0

作者：

Chudnovsky, Maria ^{[1
]}

机构：

[1] Princeton Univ, Dept Math, Princeton, NJ 08544 USA

来源：

JOURNAL OF GRAPH THEORY | 2018年 / 87卷 / 03期

关键词：

perfect graphs; wonderful lemma; GRAPHS;

D O I：

10.1002/jgt.22155

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The Wonderful Lemma, that was first proved by Roussel and Rubio, is one of the most important tools in the proof of the Strong Perfect Graph Theorem. Here we give a short proof of this lemma.

引用

页码：271 / 274

页数：4

共 50 条

[1] A Short Proof of the Blow-Up Lemma for Approximate Decompositions
Ehard, Stefan
Joos, Felix
COMBINATORICA, 2022, 42 (06) : 771 - 819
[2] AN ALGORITHMIC PROOF OF THE LOVASZ LOCAL LEMMA VIA RESAMPLING ORACLES
Harvey, Nicholas J. A.
Vondrak, Jan
SIAM JOURNAL ON COMPUTING, 2020, 49 (02) : 394 - 428
[3] A short proof of a theorem of Bang and Koolen
Mohammadian, A.
Tayfeh-Rezaie, B.
EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (05) : 1461 - 1463
[4] A short proof of interlacing inequalities on normalized Laplacians
Li, CK
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 414 (2-3) : 425 - 427
[5] Cutting lemma and union lemma for the domination game
Dorbec, Paul
Henning, Michael A.
Klavzar, Sandi
Kosmrlj, Gasper
DISCRETE MATHEMATICS, 2019, 342 (04) : 1213 - 1222
[6] Strongly perfect claw-free graphs-A short proof
Chudnovsky, Maria
Dibek, Cemil
JOURNAL OF GRAPH THEORY, 2021, 97 (03) : 359 - 381
[7] A short proof of Handel and Mosher's alternative for subgroups of Out(FN)
Horbez, Camille
GROUPS GEOMETRY AND DYNAMICS, 2016, 10 (02) : 709 - 721
[8] A Set and Collection Lemma
Levit, Vadim E.
Mandrescu, Eugen
ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
[9] An Efficient Container Lemma
Balogh, Jozsef
Samotij, Wojciech
DISCRETE ANALYSIS, 2020,
[10] A short proof of a result on a Vizing-like problem for integer total domination
Henning, Michael A.
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (03) : 321 - 323

← 1 2 3 4 5 →