William T. Trotter

J. Comb. Theory B, March, 2024

Concepts of Dimension for Convex Geometries.

[BibT_eX]

[DOI]

Kolja Knauer

SIAM J. Discret. Math., 2024

2022

Boolean dimension and dim-boundedness: Planar cover graph with a zero.

[BibT_eX]

[DOI]

Piotr Micek

Heather C. Smith Blake

CoRR, 2022

2021

Fractional Local Dimension.

[BibT_eX]

[DOI]

Heather C. Smith

Order, 2021

Planar Posets that are Accessible from Below Have Dimension at Most 6.

[BibT_eX]

[DOI]

Order, 2021

2020

Boolean Dimension, Components and Blocks.

[BibT_eX]

[DOI]

Tamás Mészáros

Piotr Micek

Order, 2020

Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension.

[BibT_eX]

[DOI]

Order, 2020

Local Dimension is Unbounded for Planar Posets.

[BibT_eX]

[DOI]

Bartlomiej Bosek

Jaroslaw Grytczuk

Electron. J. Comb., 2020

2019

The Graph of Critical Pairs of a Crown.

[BibT_eX]

[DOI]

Order, 2019

Dimension of posets with planar cover graphs excluding two long incomparable chains.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Separating tree-chromatic number from path-chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

2017

On the Dimension of Posets with Cover Graphs of Treewidth 2.

[BibT_eX]

[DOI]

Order, 2017

Boolean Dimension and Local Dimension.

[BibT_eX]

[DOI]

Bartosz Walczak

Electron. Notes Discret. Math., 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Planar Posets, Dimension, Breadth and the Number of Minimal Elements.

[BibT_eX]

[DOI]

Order, 2016

Dimension and Matchings in Comparability and Incomparability Graphs.

[BibT_eX]

[DOI]

Order, 2016

Posets and VPG Graphs.

[BibT_eX]

[DOI]

Elad Cohen

Martin Charles Golumbic

Order, 2016

Forcing Posets with Large Dimension to Contain Large Standard Examples.

[BibT_eX]

[DOI]

Graphs Comb., 2016

First-fit coloring on interval graphs has performance ratio at least 5.

[BibT_eX]

[DOI]

David A. Smith

Eur. J. Comb., 2016

Tree-width and dimension.

[BibT_eX]

[DOI]

Comb., 2016

2015

The Dimension of Posets with Planar Cover Graphs.

[BibT_eX]

[DOI]

Veit Wiechert

Graphs Comb., 2015

Dimension and cut vertices: an application of Ramsey theory.

[BibT_eX]

[DOI]

Bartosz Walczak

CoRR, 2015

2014

Incidence Posets and Cover Graphs.

[BibT_eX]

[DOI]

Order, 2014

Triangle-free intersection graphs of line segments with large chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

An extremal problem on crossing vectors.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

Hamiltonian Cycles and Symmetric Chains in Boolean Lattices.

[BibT_eX]

[DOI]

Noah Streib

Graphs Comb., 2014

2013

On-Line Dimension for Posets Excluding Two Long Incomparable Chains.

[BibT_eX]

[DOI]

Tomasz Krawczyk

Order, 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Applications of the Probabilistic Method to Partially Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2011

Dimension and Height for Posets with Planar Cover Graphs.

[BibT_eX]

[DOI]

Noah Streib

Electron. Notes Discret. Math., 2011

A combinatorial approach to height sequences in finite partially ordered sets.

[BibT_eX]

[DOI]

Csaba Biró

Discret. Math., 2011

2010

Intersection Graphs of Pseudosegments: Chordal Graphs.

[BibT_eX]

[DOI]

Cornelia Dangelmayr

J. Graph Algorithms Appl., 2010

Interval partitions and Stanley depth.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2010

On the size of maximal antichains and the number of pairwise disjoint maximal chains.

[BibT_eX]

[DOI]

David M. Howard

Discret. Math., 2010

Adjacency posets of planar graphs.

[BibT_eX]

[DOI]

Ching Man Li

Discret. Math., 2010

Segment Orders.

[BibT_eX]

[DOI]

Csaba Biró

Discret. Comput. Geom., 2010

2007

Bar k-Visibility Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2007

2005

Posets and planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2002

A Note on Graph Pebbling.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Containment orders for similar ellipses with a common center.

[BibT_eX]

[DOI]

Discret. Math., 2002

A combinatorial approach to correlation inequalities.

[BibT_eX]

[DOI]

Graham R. Brightwell

Discret. Math., 2002

2001

Competitive Colorings of Oriented Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Spanning Trees of Bounded Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

Dimension, Graph and Hypergraph Coloring.

[BibT_eX]

[DOI]

Order, 2000

Interval orders and dimension.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Combinatorial Aspects of Interval Orders and Interval Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Editorial.

[BibT_eX]

[DOI]

Discret. Math., 1999

Split semiorders.

[BibT_eX]

[DOI]

Discret. Math., 1999

Finite three dimensional partial orders which are not sphere orders.

[BibT_eX]

[DOI]

Discret. Math., 1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theory.

[BibT_eX]

[DOI]

Geir Agnarsson

Discret. Math., 1999

1998

Ramsey Theory and Sequences of Random Variables.

[BibT_eX]

[DOI]

Peter Winkler

Comb. Probab. Comput., 1998

1997

The Order Dimension of Planar Maps.

[BibT_eX]

[DOI]

Graham R. Brightwell

SIAM J. Discret. Math., 1997

Ramsey theory and partially ordered sets.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1995

On-Line and First-Fit Coloring of Graphs That Do Not Induce P5.

[BibT_eX]

[DOI]

Stephen G. Penrice

SIAM J. Discret. Math., 1995

Colorings of diagrams of interval orders and alpha-sequences of sets.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

On-Line Coloring and Recursive Graph Theory.

[BibT_eX]

[DOI]

Stephen G. Penrice

SIAM J. Discret. Math., 1994

On the fractional dimension of partially ordered sets.

[BibT_eX]

[DOI]

Discret. Math., 1994

On the poset of all posets on n elements.

[BibT_eX]

[DOI]

Richard A. Brualdi

Hyung Chan Jung

Discret. Appl. Math., 1994

1993

The Order Dimension of Convex Polytopes.

[BibT_eX]

[DOI]

Graham R. Brightwell

SIAM J. Discret. Math., 1993

Induced matchings in cubic graphs.

[BibT_eX]

[DOI]

Peter Horák

He Qing

J. Graph Theory, 1993

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.

[BibT_eX]

[DOI]

James H. Schmerl

Discret. Math., 1993

1992

Dimensions of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Large regular graphs with no induced 2K2.

[BibT_eX]

[DOI]

Graphs Comb., 1992

Colorful induced subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Linear extensions of semiorders: a maximization problem.

[BibT_eX]

[DOI]

Discret. Math., 1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.

[BibT_eX]

[DOI]

Fan R. K. Chung

Discret. Comput. Geom., 1992

1991

The Dimension of Random Ordered Sets.

[BibT_eX]

[DOI]

Paul Erdös

Random Struct. Algorithms, 1991

Fibres and ordered set coloring.

[BibT_eX]

[DOI]

Dwight Duffus

J. Comb. Theory A, 1991

Planar Graph Coloring with an Uncooperative Partner.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

On-line Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

1990

The maximum number of edges in 2K2-free graphs of bounded degree.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

An on-line graph coloring algorithm with sublinear performance ratio.

[BibT_eX]

[DOI]

László Lovász

Michael E. Saks

Discret. Math., 1989

1988

Threshold tolerance graphs.

[BibT_eX]

[DOI]

Clyde L. Monma

Bruce A. Reed

J. Graph Theory, 1988

1987

Poset boxicity of graphs.

[BibT_eX]

[DOI]

Douglas B. West

Discret. Math., 1987

A note on ranking functions.

[BibT_eX]

[DOI]

Vojtech Rödl

Discret. Math., 1987

A Ramsey theoretic problem for finite ordered sets.

[BibT_eX]

[DOI]

Discret. Math., 1987

1985

The dimension of the Cartesian product of partial orders.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

A Sperner Theorem on Unrelated Chains of Subsets.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Jürgen Stahl

J. Comb. Theory A, 1984

The interval number of a complete multipartite graph.

[BibT_eX]

[DOI]

Laurie B. Hopkins

Douglas B. West

Discret. Appl. Math., 1984

Tolerance graphs.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Clyde L. Monma

Discret. Appl. Math., 1984

Regressions and monotone chains: a ramsey - type extermal problem for partial orders.

[BibT_eX]

[DOI]

Comb., 1984

On coloring graphs with locally small chromatic number.

[BibT_eX]

[DOI]

Comb., 1984

1983

The Ramsey number of a graph with bounded maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

A Combinatorial Distinction Between the Euclidean and Projective Planes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

Extremal problems in discrete geometry.

[BibT_eX]

[DOI]

Comb., 1983

On Determinism versus Non-Determinism and Related Problems (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

A combinatorial problem involving graphs and matrices.

[BibT_eX]

[DOI]

Ted R. Monroe

Discret. Math., 1982

1981

Stacks and splits of partially ordered sets.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

A generalization of Turán's theorem to directed graphs.

[BibT_eX]

[DOI]

Stephen B. Maurer

Issie Rabinovich

Discret. Math., 1980

Large minimal realizers of a partial order II.

[BibT_eX]

[DOI]

Stephen B. Maurer

I. Rabinovitch

Discret. Math., 1980

1979

On double and multiple interval graphs.

[BibT_eX]

[DOI]

Frank Harary

J. Graph Theory, 1979

A characterization of robert's inequality for boxicity.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

When the cartesian product of directed cycles is Hamiltonian.

[BibT_eX]

[DOI]

Paul Erdös

J. Graph Theory, 1978

1977

The dimension of planar posets.

[BibT_eX]

[DOI]

John I. Moore Jr.

J. Comb. Theory B, 1977

1976

A Forbidden Subposet Characterization of an Order-Dimension Inequality.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1976

A Generalization of Hiraguchi's: Inequality for Posets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1976

A Bound on the Dimension of Interval Orders.

[BibT_eX]

[DOI]

Issie Rabinovich

J. Comb. Theory A, 1976

Some theorems on graphs and posets.

[BibT_eX]

[DOI]

John I. Moore Jr.

Discret. Math., 1976

Characterization problems for graphs, partially ordered sets, lattices, and families of sets.

[BibT_eX]

[DOI]

John I. Moore Jr.

Discret. Math., 1976

Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension.

[BibT_eX]

[DOI]

Discret. Math., 1976

On the complexity of posets.

[BibT_eX]

[DOI]

Discret. Math., 1976

1975

Embedding finite posets in cubes.

[BibT_eX]

[DOI]

Discret. Math., 1975

1974

Irreducible Posets with Large Height Exist.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1974

Dimension of the crown Skn.

[BibT_eX]

[DOI]

Discret. Math., 1974

1973

Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n.

[BibT_eX]

[DOI]