According to our database
1,
William T. Trotter
authored at least 105 papers
between 1973 and 2022.
Collaborative distances:
2022
Boolean dimension and dim-boundedness: Planar cover graph with a zero.
CoRR, 2022
2021
Fractional Local Dimension.
Order, 2021
Planar Posets that are Accessible from Below Have Dimension at Most 6.
Order, 2021
2020
Boolean Dimension, Components and Blocks.
Order, 2020
Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension.
Order, 2020
Local Dimension is Unbounded for Planar Posets.
Electron. J. Comb., 2020
2019
The Graph of Critical Pairs of a Crown.
Order, 2019
Dimension of posets with planar cover graphs excluding two long incomparable chains.
J. Comb. Theory, Ser. A, 2019
Separating tree-chromatic number from path-chromatic number.
J. Comb. Theory, Ser. B, 2019
Dimension is polynomial in height for posets with planar cover graphs.
CoRR, 2019
2017
On the Dimension of Posets with Cover Graphs of Treewidth 2.
Order, 2017
Boolean Dimension and Local Dimension.
Electron. Notes Discret. Math., 2017
Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electron. Notes Discret. Math., 2017
2016
Planar Posets, Dimension, Breadth and the Number of Minimal Elements.
Order, 2016
Dimension and Matchings in Comparability and Incomparability Graphs.
Order, 2016
Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs Comb., 2016
First-fit coloring on interval graphs has performance ratio at least 5.
Eur. J. Comb., 2016
Tree-width and dimension.
Comb., 2016
2015
The Dimension of Posets with Planar Cover Graphs.
Graphs Comb., 2015
Dimension and cut vertices: an application of Ramsey theory.
CoRR, 2015
2014
Incidence Posets and Cover Graphs.
Order, 2014
Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory, Ser. B, 2014
An extremal problem on crossing vectors.
J. Comb. Theory, Ser. A, 2014
Hamiltonian Cycles and Symmetric Chains in Boolean Lattices.
Graphs Comb., 2014
2013
On-Line Dimension for Posets Excluding Two Long Incomparable Chains.
Order, 2013
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discret. Comput. Geom., 2013
Applications of the Probabilistic Method to Partially Ordered Sets.
Proceedings of the Mathematics of Paul Erdős II, 2013
2011
Dimension and Height for Posets with Planar Cover Graphs.
Electron. Notes Discret. Math., 2011
A combinatorial approach to height sequences in finite partially ordered sets.
Discret. Math., 2011
2010
Intersection Graphs of Pseudosegments: Chordal Graphs.
J. Graph Algorithms Appl., 2010
Interval partitions and Stanley depth.
J. Comb. Theory, Ser. A, 2010
On the size of maximal antichains and the number of pairwise disjoint maximal chains.
Discret. Math., 2010
Adjacency posets of planar graphs.
Discret. Math., 2010
Discret. Comput. Geom., 2010
2007
J. Graph Algorithms Appl., 2007
2005
Posets and planar graphs.
J. Graph Theory, 2005
Bar <i>k</i>-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.
Proceedings of the Graph Drawing, 13th International Symposium, 2005
2002
A Note on Graph Pebbling.
Graphs Comb., 2002
Containment orders for similar ellipses with a common center.
Discret. Math., 2002
A combinatorial approach to correlation inequalities.
Discret. Math., 2002
2001
Competitive Colorings of Oriented Graphs.
Electron. J. Comb., 2001
Spanning Trees of Bounded Degree.
Electron. J. Comb., 2001
2000
Dimension, Graph and Hypergraph Coloring.
Order, 2000
Interval orders and dimension.
Discret. Math., 2000
1999
Combinatorial Aspects of Interval Orders and Interval Graphs.
Electron. Notes Discret. Math., 1999
Finite three dimensional partial orders which are not sphere orders.
Discret. Math., 1999
The maximum number of edges in a graph of bounded dimension, with applications to ring theory.
Discret. Math., 1999
1998
Ramsey Theory and Sequences of Random Variables.
Comb. Probab. Comput., 1998
1997
The Order Dimension of Planar Maps.
SIAM J. Discret. Math., 1997
Ramsey theory and partially ordered sets.
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 P<sub>5</sub>.
SIAM J. Discret. Math., 1995
Colorings of diagrams of interval orders and alpha-sequences of sets.
Discret. Math., 1995
1994
On-Line Coloring and Recursive Graph Theory.
SIAM J. Discret. Math., 1994
On the fractional dimension of partially ordered sets.
Discret. Math., 1994
On the poset of all posets on n elements.
Discret. Appl. Math., 1994
1993
The Order Dimension of Convex Polytopes.
SIAM J. Discret. Math., 1993
Induced matchings in cubic graphs.
J. Graph Theory, 1993
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.
Discret. Math., 1993
1992
Dimensions of hypergraphs.
J. Comb. Theory, Ser. B, 1992
Large regular graphs with no induced 2<i>K</i><sub>2</sub>.
Graphs Comb., 1992
Colorful induced subgraphs.
Discret. Math., 1992
Linear extensions of semiorders: a maximization problem.
Discret. Math., 1992
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discret. Comput. Geom., 1992
1991
The Dimension of Random Ordered Sets.
Random Struct. Algorithms, 1991
Fibres and ordered set coloring.
J. Comb. Theory, Ser. A, 1991
Planar Graph Coloring with an Uncooperative Partner.
Proceedings of the Planar Graphs, 1991
Proceedings of the On-Line Algorithms, 1991
1990
The maximum number of edges in 2K<sub>2</sub>-free graphs of bounded degree.
Discret. Math., 1990
1989
An on-line graph coloring algorithm with sublinear performance ratio.
Discret. Math., 1989
1988
Threshold tolerance graphs.
J. Graph Theory, 1988
1987
Poset boxicity of graphs.
Discret. Math., 1987
A note on ranking functions.
Discret. Math., 1987
A Ramsey theoretic problem for finite ordered sets.
Discret. Math., 1987
1985
The dimension of the Cartesian product of partial orders.
Discret. Math., 1985
1984
A Sperner Theorem on Unrelated Chains of Subsets.
J. Comb. Theory, Ser. A, 1984
The interval number of a complete multipartite graph.
Discret. Appl. Math., 1984
Discret. Appl. Math., 1984
Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
Comb., 1984
On coloring graphs with locally small chromatic number.
Comb., 1984
1983
The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory, Ser. B, 1983
A Combinatorial Distinction Between the Euclidean and Projective Planes.
Eur. J. Comb., 1983
Extremal problems in discrete geometry.
Comb., 1983
On Determinism versus Non-Determinism and Related Problems (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
A combinatorial problem involving graphs and matrices.
Discret. Math., 1982
1981
Stacks and splits of partially ordered sets.
Discret. Math., 1981
1980
A generalization of Turán's theorem to directed graphs.
Discret. Math., 1980
Large minimal realizers of a partial order II.
Discret. Math., 1980
1979
On double and multiple interval graphs.
J. Graph Theory, 1979
A characterization of robert's inequality for boxicity.
Discret. Math., 1979
1978
When the cartesian product of directed cycles is Hamiltonian.
J. Graph Theory, 1978
1977
The dimension of planar posets.
J. Comb. Theory, Ser. B, 1977
1976
A Forbidden Subposet Characterization of an Order-Dimension Inequality.
Math. Syst. Theory, 1976
A Generalization of Hiraguchi's: Inequality for Posets.
J. Comb. Theory, Ser. A, 1976
A Bound on the Dimension of Interval Orders.
J. Comb. Theory, Ser. A, 1976
Some theorems on graphs and posets.
Discret. Math., 1976
Characterization problems for graphs, partially ordered sets, lattices, and families of sets.
Discret. Math., 1976
Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension.
Discret. Math., 1976
On the complexity of posets.
Discret. Math., 1976
1975
Embedding finite posets in cubes.
Discret. Math., 1975
1974
Irreducible Posets with Large Height Exist.
J. Comb. Theory, Ser. A, 1974
Dimension of the crown S<sup>k</sup><sub>n</sub>.
Discret. Math., 1974
1973
Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n.
Discret. Math., 1973
