Conformal hypergraph

From Wikipedia, the free encyclopedia

In graph theory, a branch of mathematics, a hypergraph H is conformal if all the maximal cliques of the 2-section of H are edges of H. Here, the 2-section has an edge F if F contains two vertices and is contained in some edge of H, or if F contains at most one vertex and is an edge of H.

[edit] References

  • Claude Berge, Hypergraphs: Combinatorics of Finite Sets, North-Holland, 1989. ISBN 0444874895
This combinatorics-related article is a stub. You can help Wikipedia by expanding it.