Abstract

We survey some recent research progress on topics linking graphs and finite partially ordered sets. Among these topics are planar graphs, hamiltonian cycles and paths, graph and hypergraph coloring, on-line algorithms, intersection graphs, inclusion orders, random methods and ramsey theory. In each case, we discuss open problems and future research directions.

Citations

1493	Random Graphs - Bollobas - 2001
1478	The probabilistic method - Spencer - 1992
207	A decomposition theorem for partially ordered sets - Dilworth
183	Problems and results on 3-chromatic hypergraphs and some related questions - Erdős, Lovász - 1975
141	Partially ordered sets - Dushnik, Miller - 1941
137	Combinatorics and Partially Ordered Sets: Dimension Theory - Trotter - 1992
132	Graph theory and probability - Erdos - 1959
110	Interval Orders and Interval Graphs - Fishburn - 1985
87	The complexity of the partial order dimension problem - Yannakakis - 1982
70	Combinatorics and partially ordered sets - Trotter - 1992
67	Vorlesungen uber die Theorie der Polyeder - Steinitz, Rademacher - 1934
36	private communication - Alon - 1993
36	Intransitive indifference with unequal indifference intervals - Fishburn - 1970
34	An online graph coloring algorithm with sublinear performance ratio - Lovász, Saks, et al. - 1989
25	Extremal values of the interval number of a graph - Griggs, West
25	Problems from the world surrounding perfect graphs. Zastos - GY'ARF'AS - 1987
24	Minimal scrambling sets of simple orders - Spencer - 1972
22	Ondouble and multiple interval graphs - Trotter, Harary
20	The order dimension of convex polytopes - Brightwell, Trotter - 1993
18	On Dedekind’s problem: the number of isotone boolean functions ii - Kleitman, Markowsky - 1975
18	Planar graphs and poset dimension, Order 5 - Schnyder - 1989
17	Degrees of freedom versus dimension for containment orders - Alon, Scheinerman - 1988
17	Dimension theory for ordered sets - Kelly, Trotter - 1982
16	An effective version of dilworth theorem - Kierstead - 1981
15	Models of random partial orders - Brightwell - 1993
15	Interval orders and shift graphs - Füredi, Hajnal, et al. - 1991
13	Concerning a certain set of arrangements - Dushnik
13	Über die Auflösung von Graphen in vollständige Teilgraphen - Hajnal, Surányi - 1958
13	Monotone gray codes and the middle levels problem - Savage, Winkler - 1995
12	On the dimension of partially ordered sets - Hiraguchi
11	Fractional dimension of partial orders, Order 9 - Brightwell, Scheinerman - 1992
11	The order dimension of planar maps - Brightwell, Trotter - 1997
11	On-line graph colorings - Kierstead, Trotter - 1988
9	On the dimension of orders, Sci - Hiraguchi
9	On the pseudo-dimension of ordered sets - Novák - 1963
8	private communication - Kierstead
8	On-line coloring and recursive graph theory - Kierstead, Penrice, et al. - 1994
8	A short proof of the existence of highly chromatic graphs without short cycles - Nesetril, Rodl - 1979
8	theory and sequences of random variables - Trotter, Winkler, et al. - 1998
7	Maximal dimensional partially ordered sets III: A characterization of Hiraguchi's inequality for interval dimension, Discrete Math - Bogart, Trotter - 1976
7	On the complexity of posets - Trotter, Bogart - 1976
7	An explicit 1-factorization in the middle of the Boolean lattice - Duffus, Kierstead, et al. - 1994
7	The dimension of random ordered sets, Random Structures and Algorithms 2 - Erdos, Kierstead, et al. - 1978
7	An extremal problem in recursive combinatorics, Congressus Numerantium 33 - Kierstead, Trotter - 1981
6	Colorings of diagrams of interval orders and αsequences of sets - Felsner, Trotter - 1995
6	On the order dimension of 1-sets versus k-sets - Kierstead - 1996
6	Radius two trees specify χ-bounded classes - Kierstead, Penrice - 1994
6	personal communication - Kostochka - 2002
6	The Interval Inclusion Number of a Partially Ordered Set - Madej, West - 1991
6	Induced trees in graphs of large chromatic number - Scott - 1997