Results 71 to 80 of about 351 (173)
Matchings in balanced hypergraphs [PDF]
The present work deals with the matching and vertex cover problem in balanced hypergraphs. This class of hypergraphs is, according to the definition by Berge in the 70s, one possible generalization of bipartite graphs.
Scheidweiler, Robert Berthold
core
Chromatic capacities of graphs and hypergraphs
Given a hypergraph H, the chromatic capacity χcap(H) of H is the largest k for which there exists a k-coloring of the edges of H such that, for every coloring of the vertices of H with the edge colors, there exists an edge that has the same color as all ...
Greene, Joshua Evan
core +1 more source
Coloring hypergraphs of low connectivity
For a hypergraph G, let χ(G), Δ(G), and λ(G) denote the chromatic number, the maximum degree, and the maximum local edge connectivity of G, respectively.
Stiebitz, Michael +2 more
core +1 more source
Coloring hypergraphs with excluded minors [PDF]
Hadwiger's conjecture, among the most famous open problems in graph theory, states that every graph that does not contain $K_t$ as a minor is properly $(t-1)$-colorable.
Steiner, Raphael
core +1 more source
Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
20 pages; v2 contains relatively minor changes in presentation and updated references.
Francisco, Christopher A. +2 more
openaire +3 more sources
Coloring 2-colorable hypergraphs with a sublinear number of colors
A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs.
Mahajan, Sanjeev +3 more
core
2-colorability of r-uniform hypergraphs [PDF]
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge is completely colored by a single color. We present a complete algebraic characterization of the 2-colorability of r-uniform hypergraphs. This generalizes
Thoma, Luboš, Krul, Michael
core +1 more source
The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
Miroslaw Truszczynski, Zsolt Tuza
openaire +3 more sources
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey [PDF]
The current situation with bounds on the smallest number of edges in color-critical graphs and hypergraphs is discussed.
openaire +1 more source
Perfect colorings of hypergraphs [PDF]
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for hypergraphs ...
Taranenko, Anna A.
core +1 more source

