On perfection and imperfection of one-realizations of a given set

DOI10.1016/J.DISC.2016.03.024MaRDI QIDQ294527zbMATH OpenOpenAlexFDO

Authors Kefeng Diao, Bing Xue, Ping Zhao, V. I. Voloshin

Publication date 16 June 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.03.024

zbMATH Keywords

embedding\(\mathcal{C}\)-perfection\(\mathcal{C}\)-stable setschromatic spectrummixed hypergraph coloringone-realization

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Perfect graphs (05C17)

Recommendations

• On the structure of uniform one-realizations of a given set
• Some remarks on totally imperfect sets
• Publication:3030882
• Baire one functions and perfect sets
• On strictly perfect sets
• The consistency strength of the perfect set property for universally Baire sets of reals
• scientific article; zbMATH DE number 125727
• A perfect set of reals with finite self-information
• On perfect cones and absolute Baire-one retracts
• On the perfection of schemes

Cites work

• scientific article; zbMATH DE number 1933066 (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
• C-perfect hypergraphs
• Color-bounded hypergraphs, III: model comparison
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Color-bounded hypergraphs. V: Host graphs and subdivisions
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Coloring mixed hypergraphs: theory, algorithms and applications
• Colouring planar mixed hypergraphs
• Mixed hypergraphs and other coloring problems
• Mixed interval hypergraphs
• On feasible sets of mixed hypergraphs
• On the price of equivocation in Byzantine agreement
• Pattern 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.
• The smallest one-realization of a given set. III
• The smallest one-realization of a given set. IV
• Uncolorable mixed hypergraphs
• Uniform mixed hypergraphs: the possible numbers of colors

Cited in

(2)

• Perfektheit und die Umkehrung des Bezoutschen Satzes Herrn Professor Dr. Curt Meyer zum, 70. Geburtstag in herzlicher Verbundenheit geuridmet
• On the structure of uniform one-realizations of a given set

This page was built for publication: On perfection and imperfection of one-realizations of a given set

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