Coloring of universal graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- The Ramsey theory of Henson graphs
- The existence of uniquely \(-G\) colourable graphs
- On products of elementarily indivisible structures
- The Urysohn sphere is oscillation stable
- Many symmetrically indivisible structures
- Forcing with copies of the Rado and Henson graphs
- The complexity of generalized graph colorings
- scientific article; zbMATH DE number 4118372 (Why is no real title available?)
- Infinite lexicographic products
- On the divisibility of homogeneous hypergraphs
- Ramsey Theory on Trees and Applications
- The Ulam number of infinite graphs
- A consistent edge partition theorem for infinite graphs
- The indivisibility of the homogeneous \(K_ n\)-free graphs
- Ramsey-type properties of relational structures
- DOWNWARD UNARY COLORINGS
- Embedding Graphs into Colored Graphs
- A universal partition result for infinite homogeneous \(K_n\)-free and related graphs
- The Ramsey theory of the universal homogeneous triangle-free graph
- Edge partitions of the countable triangle free homogeneous graph
- Ramsey theory of homogeneous structures: current trends and open problems
- Products of classes of finite structures
This page was built for publication: Coloring of universal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073812)