Word-representable graphs: orientations, posets, and bounds
From MaRDI portal
Publication:6635157
DOI10.37236/12806MaRDI QIDQ6635157
Zion Hefty, Andrew Owens, Paul S. Horn, Colby Muir
Publication date: 9 November 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Posets with cover graph of pathwidth two have bounded dimension
- The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Correlation inequalities on some partially ordered sets
- On the representation number of a crown graph
- Tree-width and dimension
- Dimension and height for posets with planar cover graphs.
- A decomposition theorem for partially ordered sets
- String realizers of posets with applications to distributed computing
- Incidence Bounds for Block Designs
- Über ein Problem von K. Zarankiewicz
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- The Dimension of a Comparability Graph
- On the distribution of the length of the longest increasing subsequence of random permutations
- Planar Posets Have Dimension at Most Linear in Their Height
- Threshold Functions for Ramsey Properties
- Hasse diagrams with large chromatic number
- Orientation Ramsey Thresholds for Cycles and Cliques
- Better bounds for poset dimension and boxicity
- On the interrelation between synchronized and non-synchronized behaviour of Petri Nets
- On representable graphs
- Ordered Ramsey numbers
- Boxicity and Poset Dimension
This page was built for publication: Word-representable graphs: orientations, posets, and bounds
