✦ LIBER ✦

Frankl's Conjecture Is True for Lower Semimodular Lattices

✍ Scribed by Jürgen Reinhold

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 50 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Semimodular Types of Lattices: Fra

Lower Semimodular Types of Lattices: Frankl's Conjecture Holds for Lower Quasi-Semimodular Lattices

✍ Tetsuya Abe; Bumpei Nakano 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 196 KB

Strong semimodular lattices and Frankl's

Strong semimodular lattices and Frankl's conjecture

✍ Tetsuya Abe 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 46 KB

The -conjecture for -labelings is true f

The -conjecture for -labelings is true for total graphs

✍ Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An L(2, 1)-labeling of a graph G is defined as a function f from the vertex set V (G) into the nonnegative integers such that for any two vertices x, y, |f Griggs and Yeh conjectured that λ 2,1 (G) ≤ ∆ 2 for any simple graph with maximum degree ∆ ≥ 2. In this paper, we consider the total graph T (G

The hirsch conjecture is true for (0, 1)

The hirsch conjecture is true for (0, 1)-polytopes

✍ Denis Naddef 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 77 KB

Ohba’s conjecture is true for graphs wit

Ohba’s conjecture is true for graphs with independence number at most three

✍ Yufa Shen; Wenjie He; Guoping Zheng; Yanpo Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 426 KB

The McKay Conjecture Is True for the Spo

The McKay Conjecture Is True for the Sporadic Simple Groups

✍ Robert A. Wilson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 146 KB

The McKay conjecture states that the number of irreducible complex characters of a group G that have degree prime to p is equal to the same number for the Sylow p-normalizer in G. We verify this conjecture for the 26 sporadic simple groups.