Incidence posets and cover graphs

DOI10.1007/s11083-013-9301-9zbMath1301.06013arXiv1308.2471OpenAlexW2152531523MaRDI QIDQ2510383

William T. jun. Trotter, Rui Dong Wang

Publication date: 1 August 2014

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2471

zbMATH Keywords

dimensionchromatic numberincidence poset

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Volume computation for sparse Boolean quadric relaxations

Cites Work

• Hamiltonian cycles and symmetric chains in Boolean lattices.
• A note on Schnyder's theorem
• Planar graphs and poset dimension
• Chromatic number of Hasse diagrams, eyebrows and dimension
• Colouring lattices
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• The maximum number of edges in a graph of bounded dimension, with applications to ring theory
• The order dimension of the complete graph
• Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
• The first three levels of an order preserving Hamiltonian path in the subset lattice

This page was built for publication: Incidence posets and cover graphs