✦ LIBER ✦

Gallai theorems for graphs, hypergraphs, and set systems

✍ Scribed by E.J. Cockayne; S.T. Hedetniemi; R. Laskar

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 750 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90192-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multipartite Turán problem for connected

Multipartite Turán problem for connected graphs and hypergraphs

✍ Zsolt Tuza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Tuza, Z., Multipartite Turan problem for connected graphs and hypergraphs, Discrete Mathematics 112 (1993) 199-206. Giving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities n,, , n,,

Representation theorems for graphs whose

Representation theorems for graphs whose the vertex set is partially ordered

✍ Alain Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 768 KB

## Dedicated to E. Corominas Given a graph G =(X, E), we try to know when it is possible to consider G as the intersection graph of a finite hypergraph, when some restrietions are given on the inclusion order induced on the edge set of this hypergraph. We give some examples concerning the interva

An intersection theorem for systems of s

An intersection theorem for systems of sets

✍ A. V. Kostochka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists

Interchange Theorems for Hypergraphs and

Interchange Theorems for Hypergraphs and Factorization of Their Degree Sequences

✍ A.A. Chernyak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l 1 -distance between equivalence classes and the l 1 -distance between corresponding order-type functions are provided. The generality of this result is demon

Signed Domination in Regular Graphs and

Signed Domination in Regular Graphs and Set-Systems

✍ Zoltán Füredi; Dhruv Mubayi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Suppose G is a graph on n vertices with minimum degree r. Using standard random methods it is shown that there exists a two-coloring of the vertices of G with colors, +1 and &1, such that all closed neighborhoods contain more 1's than &1's, and all together the number of 1's does not exceed the numb

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,