On Opsut's conjecture for hypercompetition numbers of hypergraphs

DOI10.1016/j.dam.2012.05.009zbMath1252.05156OpenAlexW2083647872WikidataQ123262957 ScholiaQ123262957MaRDI QIDQ713325

Boram Park, Suh-Ryung Kim

Publication date: 26 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.009

zbMATH Keywords

competition graphcompetition numberOpsut's conjecturecompetition hypergraphhypercompetition number

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (2)

Niche hypergraphs ⋮ On the hypercompetition numbers of hypergraphs with maximum degree at most two

Cites Work

• Competition hypergraphs of products of digraphs
• Competition hypergraphs
• On the hypercompetition numbers of hypergraphs
• Competition hypergraphs of digraphs with certain properties I. Strong connectedness
• Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
• Competitive inheritance and limitedness of graphs
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Opsut's conjecture for hypercompetition numbers of hypergraphs