Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every =>0, if D is sufficiently large as a function of t, k, and =, then the chromatic index of H is at most (t&1+1Ât+=) D. We prove t
✦ LIBER ✦
The partition of a uniform hypergraph into pairs of dependent hyperedges
✍ Scribed by Jenö Lehel
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 304 KB
- Volume
- 163
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the Degree, Size, and Chromatic Index
✍
Noga Alon; Jeong Han Kim
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 274 KB
The Maximum Size of 3-Uniform Hypergraph
✍
Dominique De Caen; Zoltán Füredi
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 73 KB
A conjecture of V. So s [3] is proved that any set of 3 4 ( n 3 )+cn 2 triples from an n-set, where c is a suitable absolute constant, must contain a copy of the Fano configuration (the projective plane of order two). This is an asymptotically sharp estimate.
Minimum shadows in uniform hypergraphs a
✍
Peter Frankl; Makoto Matsumoto; Imre Z Ruzsa; Norihide Tokushige
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 687 KB
Solving a conjecture of Sedlacek: maxima
✍
Nigel Martin
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 241 KB
Interindividual variation in the partiti
✍
Juan J. Álvarez; Miguel A. Lasunción; Jose M. Olmos; Emilio Herrera
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 933 KB
In order to evaluate cardiovascular risk, we analyzed the lipid composition of HDL and the presence of Upoprotein(a) [Lp(a)] by both agarose gel electrophoresis and enzyme-linked immunoassay (ELISA). In 681 plasmas we found a close correspondence between the existence of a visible sinking pre-I~ lip
pH-Dependent Partitioning of Acidic and
✍
Schaper, Klaus-J. ;Zhang, Huabei ;Raevsky, Oleg A.
📂
Article
📅
2001
🏛
John Wiley and Sons
🌐
English
⚖ 99 KB
👁 1 views