scientific article; zbMATH DE number 3019031

Recommendations

scientific article; zbMATH DE number 3853879
On a problem of combinatorial geometry
On a problem of combinatorial geometry
On a geometric combinatorial problem
scientific article; zbMATH DE number 38305
On a problem in combinatorial geometry
scientific article; zbMATH DE number 3929843
scientific article; zbMATH DE number 176921

Cited in

(only showing first 100 items - show all)

Linear connectivity forces large complete bipartite minors
A bipartite analogue of Dilworth's theorem for multiple partial orders
Untangling a planar graph
Cross-monotone subsequences
A new proof of the Erdős-Szekeres convex k-gon result
Separating pairs of points of standard boxes
Monotone subsequences in (0,1)-matrices
Maximum induced trees in graphs
Covering with Euclidean boxes
Homotopy properties of greedoids
An extension of the Erdős-Szekeres theorem on large angles
On empty triangles determined by points in the plane
Decompositions of partially ordered sets into chains and antichains of given size
A note on monoton waves
Shuffle-compatible total orders
Nine convex sets determine a pentagon with convex sets as vertices
On the combinatorial classification of nondegenerate configurations in the plane
On unimodal subsequences
On Harrington's partition relation
On a conjecture of Erdős and Silverman in combinatorial geometry
Dimension and automorphism groups of lattices
On finite Ramsey numbers
Perfect graph decompositions
Angle orders and zeros
Permutation vs. non-permutation flow shop schedules
Some notes on the Erdős-Szekeres theorem
Approximating maximum independent sets by excluding subgraphs
On a Ramsey-theoretic property of orders
Monochromatic vs multicolored paths
Ramsey's theorem - a new lower bound
Ramsey graphs and block designs
Existence of submatrices with all possible columns
Weak versions of Ramsey's theorem
The probability method: Successes and limitations
Crossing families
Some Erdős-Szekeres type results about points in space
An extremal problem of orthants containing at most one point besides the origin
A Ramsey property of order types
Approximating the independence number via the -function
Universal 3-dimensional visibility representations for graphs
Intersections of longest cycles in \(k\)-connected graphs
On the number of cycles in 3-connected cubic graphs
The rectangle of influence drawability problem
Graph minors. XVI: Excluding a non-planar graph
A limit theorem for sets of stochastic matrices.
Hydrodynamical methods for analyzing longest increasing subsequences
Characterising inflations of monotone grid classes of permutations
Longest increasing subsequences and log concavity
Colouring squares of claw-free graphs
Equiangular lines and spherical codes in Euclidean space
The dual diameter of triangulations
Colored ray configurations
Ramsey numbers and monotone colorings
Edges not in any monochromatic copy of a fixed graph
A graph with the partial order competition dimension greater than five
An easy subexponential bound for online chain partitioning
Forbidden subposet problems for traces of set families
Ramsey numbers for partially-ordered sets
Lexicographic Ramsey theory
Graph minors. IX: Disjoint crossed paths
Two combinatorial problems on posets
Non-Ramsey graphs are c n-universal
Diperfect graphs
On homogeneous sets of positive integers
Large convex holes in random point sets
Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric
The Erdős-Szekeres theorem and congruences
Cyclic polytopes and oriented matroids
LIL for the length of the longest increasing subsequences
A note on the value in the disjoint convex partition problem
On the existence of a point subset with 3 or 6 interior points
Convexly independent subsets of Minkowski sums of convex polygons
Saturation problems in the Ramsey theory of graphs, posets and point sets
Finding and counting permutations via CSPs
Simultaneous embedding of colored graphs
Faster counting empty convex polygons in a planar point set
Representing point sets on the plane as permutations
The Wiener index of signed graphs
An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
Gallai-Ramsey number of odd cycles with chords
Excluding a ladder
On off-diagonal ordered Ramsey numbers of nested matchings
An almost optimal bound on the number of intersections of two simple polygons
The Erdős-Hajnal conjecture for three colors and triangles
A note on multicolor Ramsey number of small odd cycles versus a large clique
Fundamental limits of exact support recovery in high dimensions
Two extensions of the Erdős-Szekeres problem
Lower bounds for multicolor Ramsey numbers
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
Blowup Ramsey numbers
On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
Balanced convex partitions of lines in the plane
Empty monochromatic simplices
Covering paths for planar point sets
Disjoint empty convex pentagons in planar point sets
Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
Half-integral packing of odd cycles through prescribed vertices
Polymatroid greedoids
On order types of systems of segments in the plane
A superlinear lower bound on the number of 5-holes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5759552)