𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Color critical hypergraphs with many edges

✍ Scribed by V. Rödl; M. Siggers

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
275 KB
Volume
53
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Edges in Hypergraphs Cr
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings
✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

Definitions of criticality with respect
Definitions of criticality with respect to edge-coloring
✍ A. J. W. Helton 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB

## Abstract Here we examine six definitions of criticality concerning the chromatic index (edge chromatic number) of a simple graph. Five of these turn out to be almost always almost equivalent. Some problems arise and some conjectures are posed.

On the use of alternating chains and hyp
On the use of alternating chains and hypergraphs in edge coloring
✍ D. de Werra 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 320 KB

## Abstract Existence of some generalized edge colorings is proved by using the properties of hypergraphs as well as alternating chain methods. A general framework is given for edge colorings and some general properties of balancing are derived.

Hypergraphs with large transversal numbe
Hypergraphs with large transversal number and with edge sizes at least 3
✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

## Abstract It is shown in several manuscripts [Discrete Math 86 (1990), 117–126; Combinatorica 12 (1992), 19–26] that every hypergraph of order __n__ and size __m__ with edge sizes at least 3 has a transversal of size at most (__n__ + __m__)/4. In this article, we characterize the connected such h

The chromatic index of graphs of even or
The chromatic index of graphs of even order with many edges
✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

We show that, for r = 1, 2, a graph G with 2n + 2 (26) vertices and maximum degree 2n + 1 -r is of Class 2 if and only if (E(G\v)I > ('"2+')m, where v is a vertex of G of minimum degree, and we make a conjecture for 1 s r s n, of which this result is a special case. For r = 1 this result is due to P

Characterization of edge-colored complet
Characterization of edge-colored complete graphs with properly colored Hamilton paths
✍ Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Gutin; Tommy Jensen; Arash Ra 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

## Abstract An edge‐colored graph __H__ is properly colored if no two adjacent edges of __H__ have the same color. In 1997, J. Bang‐Jensen and G. Gutin conjectured that an edge‐colored complete graph __G__ has a properly colored Hamilton path if and only if __G__ has a spanning subgraph consisting