Volume 10, November 2001, Pages 194-197. Electronic Notes in Discrete Mathematics. Articles. Transversals of hypergraphs with geometric flavor.
May 21, 2001 · Helly's theorem asserts that if F is a finite family of convex sets in Rd in which every d + 1 or fewer sets have a point in common then T F ...
Missing: flavor. | Show results with:flavor.
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect ...
Dec 1, 2016 · Geometrically defined graphs and hypergraphs are a classical topic in discrete mathematics. In fact, the Four-Color-Problem for planar graphs is ...
Feb 6, 2018 · A linear hypergraph is one in which every two distinct edges intersect in at most one vertex. A k-uniform hypergraph has all edges of size k.
Missing: geometric flavor.
We consider the problem of enumerating all minimal hitting sets of a given hypergraph (V, R), where V is a finite set, called the vertex set and R is a set ...
Missing: flavor. | Show results with:flavor.
... Transversals of hypergraphs with geometric flavor. 194-197. Electronic Edition (link) BibTeX · Colin McDiarmid, Bruce A. Reed: Channel Assignment on Nearly�...
Most of this work concerns generalizations of the Laplacian spectrum of a graph, and has a very different flavor than the subject we discuss in the sequel.
In mathematics, incidence geometry is the study of incidence structures. A geometric structure such as the Euclidean plane is a complicated object that ...
Transversals of hypergraphs with geometric flavor. Article. Nov 2001; Electron Notes Discrete Math. Jirí Matousek. See extended abstract in 'full paper'. View.