𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge search in graphs and hypergraphs of bounded rank

✍ Scribed by Ingo Althöfer; Eberhard Triesch

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
512 KB
Volume
115
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Althofer, 1. and E. Triesch, Edge search in graphs and hypergraphs of bounded rank, Discrete Mathematics 115 (1993) l-9.

📜 SIMILAR VOLUMES

Fractional v. Integral Covers in Hypergr
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size
✍ Jeff Kahn; P.Mark Kayll 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 470 KB

In the early 1980's, V. Ro dl proved the Erdo s Hanani Conjecture, sparking a remarkable sequence of developments in the theory of packing and covering in hypergraphs of bounded edge size. Generalizations were given by P. Frankl and Ro dl, by N. Pippenger, and by others. In each case, an appropriate

New Lower Bounds for Ramsey Numbers of G
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,

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.

The maximum number of edges in 2K2-free
The maximum number of edges in 2K2-free graphs of bounded degree
✍ F.R.K. Chung; A. Gyárfás; Z. Tuza; W.T. Trotter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A graph is 2K,-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K,-free and has maximum degree A(G) = D, then G has at most 5D2/4 edges if D is even. If D is odd, this bound can be improved to (5D\* -20 + 1)/4. The extremal graphs are unique.