𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Denis Naddef

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
77 KB
Volume
45
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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.