View More View Less
  • 1 Alfréd Rényi Institute of Mathematics 1053 Budapest Reáltanoda u. 13-15 Hungary
  • | 2 Eötvös University Department of Computer Science 1518 Budapest P.O.Box 120 Hungary
Restricted access


We determine a class of triple systems such that each must occur in a triple system with uncountable chromatic number that omits
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathcal{T}_0$$ \end{document}
(the unique system consisting of two triples on four vertices). This class contains all odd circuits of length ≧ 7. We also show that consistently there are two finite triple systems such that they can separately be omitted by uncountably chromatic triple systems but not both.
All Time Past Year Past 30 Days
Abstract Views 1 1 0
Full Text Views 5 5 0
PDF Downloads 1 1 0