The following pages link to (Q5759552):
Displaying 50 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- An improved upper bound for the Erdős-Szekeres conjecture (Q306509) (← links)
- Major index distribution over permutation classes (Q308984) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Twins in words and long common subsequences in permutations (Q314398) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- The parallel stack loading problem to minimize blockages (Q321007) (← links)
- Large unavoidable subtournaments (Q322361) (← links)
- Separating families of convex sets (Q364852) (← links)
- On two problems in graph Ramsey theory (Q377800) (← links)
- On the order dimension of convex geometries (Q382888) (← links)
- An improved bound for the stepping-up lemma (Q385142) (← links)
- Monochromatic empty triangles in two-colored point sets (Q385155) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Two extensions of Ramsey's theorem (Q394821) (← links)
- Chromatic numbers of copoint graphs of convex geometries (Q397165) (← links)
- The shape of random pattern-avoiding permutations (Q401507) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns (Q444905) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Erdős-Szekeres tableaux (Q466878) (← links)
- On the number of monotone sequences (Q490988) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Constructions and nonexistence results for suitable sets of permutations (Q507826) (← links)
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems (Q518192) (← links)
- On three measures of non-convexity (Q522338) (← links)
- A conjecture of Erdős on graph Ramsey numbers (Q531812) (← links)
- Large almost monochromatic subsets in hypergraphs (Q532593) (← links)
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm (Q534213) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- Strictly monotonic multidimensional sequences and stable sets in pillage games (Q618306) (← links)
- Order types of convex bodies (Q633225) (← links)
- Grid classes and partial well order (Q645965) (← links)
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- On the existence of a point subset with three or five interior points (Q650258) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- New lower bounds for Ramsey numbers of graphs and hypergraphs (Q696820) (← links)
- Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
- Almost empty monochromatic quadrilaterals in planar point sets (Q722152) (← links)
- A new upper bound for diagonal Ramsey numbers (Q731208) (← links)
- On the multicolor Ramsey number of a graph with \(m\) edges (Q738836) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- A note on a Ramsey-type problem for sequences (Q743660) (← links)
