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

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)204-212
Number of pages9
JournalJournal of the Australian Mathematical Society
Volume50
Issue number2
DOIs
Publication statusPublished - 1991

Fingerprint

Maximum Degree
Graph in graph theory
Multigraph
Pairwise
Open Problems
Disjoint
Theorem

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

On r-Graphs and r-Multihypergraphs with given Maximum Degree. / Füredi, Z.

In: Journal of the Australian Mathematical Society, Vol. 50, No. 2, 1991, p. 204-212.

Research output: Contribution to journalArticle

@article{d67749c92cb14205b955b2c0e3775b87,
title = "On r-Graphs and r-Multihypergraphs with given Maximum Degree",
abstract = "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.",
author = "Z. F{\"u}redi",
year = "1991",
doi = "10.1017/S1446788700032699",
language = "English",
volume = "50",
pages = "204--212",
journal = "Journal of the Australian Mathematical Society",
issn = "1446-7887",
publisher = "Cambridge University Press",
number = "2",

}

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 -