scientific article; zbMATH DE number 3019031
From MaRDI portal
Publication:5759552
zbMath0012.27010MaRDI QIDQ5759552
No author found.
Publication date: 1935
Full work available at URL: http://www.numdam.org/item?id=CM_1935__2__463_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Monotone subsequences in (0,1)-matrices ⋮ Maximum induced trees in graphs ⋮ Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Covering with Euclidean boxes ⋮ An improved upper bound for the Erdős-Szekeres conjecture ⋮ Major index distribution over permutation classes ⋮ Erdős-Szekeres without induction ⋮ Twins in words and long common subsequences in permutations ⋮ Unsplittable coverings in the plane ⋮ The parallel stack loading problem to minimize blockages ⋮ Large unavoidable subtournaments ⋮ Homotopy properties of greedoids ⋮ On the positive fraction Erdős-Szekeres theorem for convex sets ⋮ An extension of the Erdős-Szekeres theorem on large angles ⋮ On empty triangles determined by points in the plane ⋮ A bipartite analogue of Dilworth's theorem ⋮ Decompositions of partially ordered sets into chains and antichains of given size ⋮ Abstract order type extension and new results on the rectilinear crossing number ⋮ Separating families of convex sets ⋮ A note on monoton waves ⋮ Shuffle-compatible total orders ⋮ Nine convex sets determine a pentagon with convex sets as vertices ⋮ Some recent progress and applications in graph minor theory ⋮ On two problems in graph Ramsey theory ⋮ Turán-type results for partial orders and intersection graphs of convex sets ⋮ On the order dimension of convex geometries ⋮ An improved bound for the stepping-up lemma ⋮ Monochromatic empty triangles in two-colored point sets ⋮ Induced subgraphs of Ramsey graphs with many distinct degrees ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ Two extensions of Ramsey's theorem ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ Strictly monotonic multidimensional sequences and stable sets in pillage games ⋮ The shape of random pattern-avoiding permutations ⋮ On the combinatorial classification of nondegenerate configurations in the plane ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ On unimodal subsequences ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ On \(k\)-convex polygons ⋮ Order types of convex bodies ⋮ On Harrington's partition relation ⋮ F. P. Ramsey: the theory, the myth, and the mirror ⋮ On a conjecture of Erdős and Silverman in combinatorial geometry ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ Grid classes and partial well order ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ On the existence of a point subset with three or five interior points ⋮ Rectangle packing with additional restrictions ⋮ Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 ⋮ Dimension and automorphism groups of lattices ⋮ Packing cycles with modularity constraints ⋮ Erdős-Szekeres tableaux ⋮ On finite Ramsey numbers ⋮ Perfect graph decompositions ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ On the structure of graphs with low obstacle number ⋮ Angle orders and zeros ⋮ Permutation vs. non-permutation flow shop schedules ⋮ Some notes on the Erdős-Szekeres theorem ⋮ On the number of monotone sequences ⋮ Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Constructions and nonexistence results for suitable sets of permutations ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems ⋮ On a Ramsey-theoretic property of orders ⋮ On three measures of non-convexity ⋮ Unavoidable patterns ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Monochromatic vs multicolored paths ⋮ Large almost monochromatic subsets in hypergraphs ⋮ Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm ⋮ New lower bounds for Ramsey numbers of graphs and hypergraphs ⋮ Set-coloring of edges and multigraph Ramsey numbers ⋮ Ramsey's theorem - a new lower bound ⋮ Finding common structured patterns in linear graphs ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ A new upper bound for diagonal Ramsey numbers ⋮ On the multicolor Ramsey number of a graph with \(m\) edges ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ A note on a Ramsey-type problem for sequences ⋮ Erdős-Szekeres theorem for lines ⋮ The directed packing numbers DD(t,v,v), t\(\geq 4\) ⋮ On the number of homogeneous subgraphs of a graph ⋮ Linear connectivity forces large complete bipartite minors ⋮ Angle orders ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ Finding regular insertion encodings for permutation classes ⋮ A bipartite analogue of Dilworth's theorem for multiple partial orders ⋮ Untangling a planar graph ⋮ Cross-monotone subsequences ⋮ Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices ⋮ The complexity of matrix transposition on one-tape off-line Turing machines ⋮ The conjunctive complexity of quadratic Boolean functions ⋮ A new proof of the Erdős-Szekeres convex k-gon result ⋮ Separating pairs of points of standard boxes
This page was built for publication:
