The smallest one-realization of a given set. III

DOI10.1007/S00373-013-1322-ZMaRDI QIDQ742599zbMATH OpenOpenAlexFDO

Authors Kefeng Diao, Ping Zhao, Kaishun Wang

Publication date 19 September 2014

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

feasible setmixed hypergraphone-realizationhypergraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Abstract: In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), $sharp$P19], we determined the minimum number of vertices of one-realizations of a given finite set $S$, and constructed the corresponding mixed hypergraphs. In this paper, by finding some of their spanning sub-hypergraphs, we determine the minimum number of $calD$-deges (resp. $calC$-edges) of one-realizations of $S$. As a result, we partially solve an open problem proposed by Tuza and Voloshin in 2008.

Recommendations

• The smallest one-realization of a given set
• The smallest one-realization of a given set. II.
• More results on the smallest one-realization of a given set. II
• More result on the smallest one-realization of a given set
• The smallest one-realization of a given set. IV

Cites work

• scientific article; zbMATH DE number 5296053 (Why is no real title available?)
• scientific article; zbMATH DE number 5575317 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• About the upper chromatic number of a co-hypergraph
• Coloring mixed hypergraphs: theory, algorithms and applications
• Colouring planar mixed hypergraphs
• Gaps in the chromatic spectrum of face-constrained plane graphs
• On feasible sets of mixed hypergraphs
• The chromatic spectrum of 3-uniform bi-hypergraphs
• The chromatic spectrum of mixed hypergraphs
• The smallest one-realization of a given set
• The smallest one-realization of a given set. II.
• Uniform mixed hypergraphs: the possible numbers of colors

Cited in

(8)

• On perfection and imperfection of one-realizations of a given set
• More result on the smallest one-realization of a given set
• The smallest one-realization of a given set
• The smallest one-realization of a given set. II.
• On the structure of uniform one-realizations of a given set
• More results on the smallest one-realization of a given set. II
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
• The smallest one-realization of a given set. IV

This page was built for publication: The smallest one-realization of a given set. III

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