The following pages link to (Q5759552):
Displaying 50 items.
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- The directed packing numbers DD(t,v,v), t\(\geq 4\) (Q759759) (← links)
- On the number of homogeneous subgraphs of a graph (Q759767) (← links)
- Angle orders (Q762509) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- Finding regular insertion encodings for permutation classes (Q765858) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- On the positive fraction Erdős-Szekeres theorem for convex sets (Q852711) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Induced subgraphs of Ramsey graphs with many distinct degrees (Q885296) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- F. P. Ramsey: the theory, the myth, and the mirror (Q906019) (← links)
- Unavoidable patterns (Q958758) (← links)
- Set-coloring of edges and multigraph Ramsey numbers (Q968224) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- A new proof of the Erdős-Szekeres convex k-gon result (Q1074867) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- Monotone subsequences in (0,1)-matrices (Q1076026) (← links)
- Maximum induced trees in graphs (Q1082351) (← links)
- Covering with Euclidean boxes (Q1091402) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- An extension of the Erdős-Szekeres theorem on large angles (Q1109334) (← links)
- On empty triangles determined by points in the plane (Q1109343) (← links)
- Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
- A note on monoton waves (Q1119693) (← links)
- Shuffle-compatible total orders (Q1122594) (← links)
- Nine convex sets determine a pentagon with convex sets as vertices (Q1123407) (← links)
- On the combinatorial classification of nondegenerate configurations in the plane (Q1146677) (← links)
- On unimodal subsequences (Q1148905) (← links)
- On Harrington's partition relation (Q1152363) (← links)
- On a conjecture of Erdős and Silverman in combinatorial geometry (Q1158643) (← links)
- Dimension and automorphism groups of lattices (Q1169489) (← links)
- On finite Ramsey numbers (Q1173103) (← links)
- Perfect graph decompositions (Q1175555) (← links)
- Angle orders and zeros (Q1176975) (← links)
- Permutation vs. non-permutation flow shop schedules (Q1180831) (← links)
- Some notes on the Erdős-Szekeres theorem (Q1182859) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- On a Ramsey-theoretic property of orders (Q1199999) (← links)
- Monochromatic vs multicolored paths (Q1205343) (← links)
- Ramsey's theorem - a new lower bound (Q1213441) (← links)
