Displaying similar documents to “An anti-Ramsey theorem on edge-cuts”

Hypergraphs with large transversal number and with edge sizes at least four

Michael Henning, Christian Löwenstein (2012)

Open Mathematics

Similarity:

Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...

Edge-domatic numbers of cacti

Bohdan Zelinka (1991)

Mathematica Bohemica

Similarity:

The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.