Chromatic numbers of copoint graphs of convex geometries
DOI10.1016/J.DISC.2014.05.013zbMATH Open1296.05067OpenAlexW2021147130MaRDI QIDQ397165FDOQ397165
Walter Morris, Jonathan E. Beagley
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.05.013
Recommendations
chromatic numberclique numberconvex geometry[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Szekeres+problem&go=Go Erd��s-Szekeres problem]order dimensioncopoint graph
Cites Work
- Families of \(k\)-independent sets
- The theory of convex geometries
- Title not available (Why is that?)
- Title not available (Why is that?)
- The order dimension of the complete graph
- Dimension, graph and hypergraph coloring
- Concerning a Certain Set of Arrangements
- Title not available (Why is that?)
- The Erdos-Szekeres problem on points in convex position – a survey
- Combinatorial representation and convex dimension of convex geometries
- Coloring copoints of a planar point set
- On the order dimension of convex geometries
- Hypergraph Ramsey numbers
- Enumeration of intersecting families
- Convex dimension of locally planar convex geometries
- Enumerating order types for small point sets with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of binary covering arrays
Cited In (2)
This page was built for publication: Chromatic numbers of copoint graphs of convex geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397165)