The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
From MaRDI portal
Publication:2409524
DOI10.1007/s00373-017-1810-7zbMath1371.05200OpenAlexW2618315585MaRDI QIDQ2409524
Fuliang Lu, Kefeng Diao, Ping Zhao, Vitaly I. Voloshin
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1810-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The chromatic spectrum of 3-uniform bi-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
- Mixed hypergraphs and other coloring problems
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Mixed interval hypergraphs
- Edge-colorings of complete graphs that avoid polychromatic trees
- About the upper chromatic number of a co-hypergraph
- Colouring planar mixed hypergraphs
- Edge-colorings with no large polychromatic stars
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Pattern hypergraphs
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- The smallest one-realization of a given set. IV
- On the price of equivocation in byzantine agreement
- Color-bounded hypergraphs, V: host graphs and subdivisions
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Mario Gionfriddo and mixed hypergraph coloring
- Chromatic polynomials of hypergraphs
- Gaps in the chromatic spectrum of face-constrained plane graphs
- On a generalized anti-Ramsey problem
This page was built for publication: The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
