Premium
The λ‐complete multigraphs
Author(s) -
Gardner M. L.
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050309
Subject(s) - hypergraph , combinatorics , mathematics , element (criminal law) , multigraph , multiple edges , discrete mathematics , graph , political science , law
Let E 1 …… E m be the edges of a hypergraph. Assume each element in the union of the edges occurs in at least two of E 1 …… E m . Assume further that every pair of distinct edges, E 1 , and E 1 , intersect in at most one element and that for each such pair there are exactly λ other edges E k such that E 1 and E 1 both intersect E k . We characterize the hypergraphs for which each | E 1 | ≤ 2. These are the λ‐complete multigraphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom