Chromatic numbers of copoint graphs of convex geometries

DOI10.1016/j.disc.2014.05.013zbMath1296.05067OpenAlexW2021147130MaRDI QIDQ397165

Jonathan E. Beagley, Walter D. jun. Morris

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

zbMATH Keywords

chromatic numberclique numberorder dimensionconvex geometryErdős-Szekeres problemcopoint graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) General convexity (52A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the order dimension of convex geometries
• A survey of binary covering arrays
• Enumeration of intersecting families
• The theory of convex geometries
• Combinatorial representation and convex dimension of convex geometries
• The order dimension of the complete graph
• Dimension, graph and hypergraph coloring
• Convex dimension of locally planar convex geometries
• Enumerating order types for small point sets with applications
• Coloring copoints of a planar point set
• Families of \(k\)-independent sets
• Hypergraph Ramsey numbers
• The Erdos-Szekeres problem on points in convex position – a survey
• Concerning a Certain Set of Arrangements

This page was built for publication: Chromatic numbers of copoint graphs of convex geometries