The competition hypergraphs of doubly partial orders

DOI10.1016/J.DAM.2012.05.024zbMATH Open1288.05187arXiv1111.4375OpenAlexW2034893393MaRDI QIDQ2448902FDOQ2448902

Authors: Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano 

Publication date: 5 May 2014

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

Abstract: Since Cho and Kim (2005) showed that the competition graph of a doubly partial order is an interval graph, it has been actively studied whether or not the same phenomenon occurs for other variants of competition graph and interesting results have been obtained. Continuing in the same spirit, we study the competition hypergraph, an interesting variant of the competition graph, of a doubly partial order. Though it turns out that the competition hypergraph of a doubly partial order is not always interval, we completely characterize the competition hypergraphs of doubly partial orders which are interval.

Full work available at URL: https://arxiv.org/abs/1111.4375

Recommendations

• The \(m\)-step competition graphs of doubly partial orders
• The niche graphs of doubly partial orders
• On the competition graphs of \(d\)-partial orders
• A class of acyclic digraphs with interval competition graphs
• The phylogeny graphs of doubly partial orders

zbMATH Keywords

competition graphsinterval hypergraphsdoubly partial orderscompetition hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cites Work

• Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
• The \(m\)-step competition graphs of doubly partial orders
• A class of acyclic digraphs with interval competition graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The niche graphs of doubly partial orders
• Title not available (Why is that?)
• The phylogeny graphs of doubly partial orders
• On CCE graphs of doubly partial orders
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Introduction to graph and hypergraph theory
• The competition-common enemy graph of a digraph
• Niche graphs
• The \(m\)-step competition graph of a digraph
• Competition hypergraphs
• The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
• 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
• Competition hypergraphs of products of digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The domination and competition graphs of a tournament
• Title not available (Why is that?)
• Interval competition graphs of symmetric digraphs
• Competition Graphs of Strongly Connected and Hamiltonian Digraphs
• Title not available (Why is that?)

Cited In (11)

• On the partial order competition dimensions of chordal graphs
• On the competition graphs of \(d\)-partial orders
• On the hypercompetition numbers of hypergraphs with maximum degree at most two
• A graph with the partial order competition dimension greater than five
• The phylogeny graphs of doubly partial orders
• Title not available (Why is that?)
• The \(m\)-step competition graphs of doubly partial orders
• Niche hypergraphs
• Competition hypergraphs of products of digraphs
• The niche graphs of doubly partial orders
• The partial order competition dimensions of bipartite graphs

This page was built for publication: The competition hypergraphs of doubly partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448902)