A counter-example to Voloshin's hypergraph co-perfectness conjecture

Australasian Journal of Combinatorics

Volumn 27, Issue , 2003, Pages 253-261

  Král, Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24844481133     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. N. Alon, On a conjecture of Erdös, Simonovits, and Sós concerning anti-Ramsey theorems, J. Graph Theory 1 (1983), 91-94.
2. Z. Dvořák and D. Král', On Planar Mixed Hypergraphs, Electronic J. Combin. 8 (1) (2001), #R35.
3. P. Erdös, M. Simonovits and V.T. Sós, Anti-Ramsey theorems, Coll. Math. Soc. J. Bolyai 10, Infinite and finite sets, Keszthely, Hungary (1973), 657-665.
4. T. Jiang, Edge-colorings with no large polychromatic stars, to appear in Graphs and Combinatorics.
5. T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West, The chromatic spectrum of mixed hypergraphs, Graphs and Combinatorics 18(2) (2002), 309-318.
6. T. Jiang and D.B. West, Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees, to appear in Discrete Mathematics.
7. T. Jiang and D.B. West, On the Erdos-Simonovits-Sos Conjecture on the anti-Ramsey number of a cycle, submitted.
8. D. Kobler and A. Kündgen, Gaps in the chromatic spectrum of face-constrained plane graphs, Electronic J. Combin. 8(1) (2001), #N3.
9. D. Král', On Feasible Sets of Mixed Hypergraphs, submitted.,
10. D. Král', On Maximum Face-Constrained Coloring of Plane Graphs of Girth at least 5, submitted.
11. D. Král', J. Kratochvíl and H.-J. Voss, Mixed Hypercacti, to appear in Discrete Mathematics.
12. D. Král', J. Kratochvíl and H.-J. Voss, Mixed Hypergraphs with Bounded Degree: Edge-Colouring of Mixed Multigraphs, to appear in Theoretical Computer Science.
13. D. Král', J. Kratochvíl and H.-J. Voss, Mixed Hypertrees, submitted.
14. A. Kündgen, E. Mendelsohn and V. Voloshin, Colouring planar mixed hypergraphs, Electronic J. Combin. 7 (2000), #R60.
15. A. Kündgen and R. Ramamurthi, Coloring face-hypergraphs of graphs on surfaces, J. Combin. Theory Ser. B 85 (2002), 307-337.
16. R. Ramamurthi and D. B. West, Maximum Face-Constrained Coloring of Plane Graphs, to appear in Discrete Mathematics.
17. n, Combinatorica 4 (1984), 101-110.
18. V. Voloshin, Coloring mixed hypergraphs: Theory, algorithms and applications, AMS, Providence, 2002.
19. V. Voloshin: On the upper chromatic number of a hypergraph, Australas. J. Combin. 11 (1995), 25-45.