TY - JOUR

T1 - On r-Graphs and r-Multihypergraphs with given Maximum Degree

AU - Füredi, Z.

PY - 1991

Y1 - 1991

N2 - It is well-known that if G is a multigraph (that is, a graph with multiple edges), the maximum number of pairwise disjoint edges in G is v(G) and its maximum degree is D(G), then| E(G)|≤ν⌊3D/2⌋. We extend this theorem for r-graphs (that is, families of r-element sets) and for r-multihypergraphs (that is, r-graphs with repeated edges). Several problems remain open.

AB - It is well-known that if G is a multigraph (that is, a graph with multiple edges), the maximum number of pairwise disjoint edges in G is v(G) and its maximum degree is D(G), then| E(G)|≤ν⌊3D/2⌋. We extend this theorem for r-graphs (that is, families of r-element sets) and for r-multihypergraphs (that is, r-graphs with repeated edges). Several problems remain open.

UR - http://www.scopus.com/inward/record.url?scp=84959599839&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959599839&partnerID=8YFLogxK

U2 - 10.1017/S1446788700032699

DO - 10.1017/S1446788700032699

M3 - Article

AN - SCOPUS:84959599839

VL - 50

SP - 204

EP - 212

JO - Journal of the Australian Mathematical Society

JF - Journal of the Australian Mathematical Society

SN - 1446-7887

IS - 2

ER -