The smallest one-realization of a given set. III

From MaRDI portal
Publication:742599

DOI10.1007/S00373-013-1322-ZzbMATH Open1298.05114arXiv1208.0875OpenAlexW4234988507MaRDI QIDQ742599FDOQ742599


Authors: Kefeng Diao, Ping Zhao, Kaishun Wang Edit this on Wikidata


Publication date: 19 September 2014

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

Abstract: In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), sharpP19], 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.


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




Recommendations




Cites Work


Cited In (8)





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)