The following pages link to William T. jun. Trotter (Q792346):
Displaying 50 items.
- (Q200924) (redirect page) (← links)
- (Q251895) (redirect page) (← links)
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- An extremal problem on crossing vectors. (Q458279) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- First-fit coloring on interval graphs has performance ratio at least 5 (Q499473) (← links)
- A Sperner theorem on unrelated chains of subsets (Q594865) (← links)
- A combinatorial approach to height sequences in finite partially ordered sets (Q629196) (← links)
- On the size of maximal antichains and the number of pairwise disjoint maximal chains (Q710589) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- On coloring graphs with locally small chromatic number (Q759761) (← links)
- Angle orders (Q762509) (← links)
- Comparing Dushnik-Miller dimension, Boolean dimension and local dimension (Q781526) (← links)
- Boolean dimension, components and blocks (Q781531) (← links)
- The interval number of a complete multipartite graph (Q792347) (← links)
- A combinatorial distinction between the Euclidean and projective planes (Q793745) (← links)
- Extremal problems in discrete geometry (Q794651) (← links)
- Regressions and monotone chains: A Ramsey-type extremal problem for partial orders (Q794668) (← links)
- The Ramsey number of a graph with bounded maximum degree (Q798674) (← links)
- Tolerance graphs (Q798675) (← links)
- The number of depth-first searches of an ordered set (Q909681) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- Interval partitions and Stanley depth (Q965226) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- The dimension of the Cartesian product of partial orders (Q1061151) (← links)
- Inequalities for the greedy dimensions of ordered sets (Q1065837) (← links)
- A Ramsey theoretic problem for finite ordered sets (Q1088690) (← links)
- Regressions and monotone chains. II: the poset of integer intervals (Q1090686) (← links)
- Arithmetic progressions in partially ordered sets (Q1093657) (← links)
- Poset boxicity of graphs (Q1103652) (← links)
- A note on ranking functions (Q1103656) (← links)
- Explicit matchings in the middle levels of the Boolean lattice (Q1117950) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- A characterization of Robert's inequality for boxicity (Q1132899) (← links)
- A generalization of Turan's theorem to directed graphs (Q1143405) (← links)
- Large minimal realizers of a partial order. II (Q1148925) (← links)
- Stacks and splits of partially ordered sets (Q1160199) (← links)
- A combinatorial problem involving graphs and matrices (Q1169462) (← links)
- Angle orders and zeros (Q1176975) (← links)
- Fibres and ordered set coloring (Q1177956) (← links)
- The number of different distances determined by a set of points in the Euclidean plane (Q1186077) (← links)
- Large regular graphs with no induced \(2K_ 2\) (Q1196569) (← links)
- Linear extensions of semiorders: A maximization problem (Q1196746) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- Balance theorems for height-2 posets (Q1205154) (← links)
- Irreducible posets with large height exist (Q1212023) (← links)
- The dimension of planar posets (Q1217722) (← links)
