Publication:5759552
From MaRDI portal
zbMath0012.27010MaRDI QIDQ5759552
Publication date: 1935
Full work available at URL: http://www.numdam.org/item?id=CM_1935__2__463_0
51-XX: Geometry
Related Items
On the distribution of the length of the longest increasing subsequence of random permutations, Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design, An upper bound for Ramsey numbers, Partition relations for cardinal numbers, Paul Erdős, 1913-1996, On a theorem of Erdős and Szekeres, On a combinatorial game, Disjoint empty convex polygons in planar point sets, Crossing patterns of segments, Concerning a Certain Set of Arrangements, New lower bounds for Ramsey numbers of graphs and hypergraphs, The directed packing numbers DD(t,v,v), t\(\geq 4\), On the number of homogeneous subgraphs of a graph, Angle orders, 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, On the positive fraction Erdős-Szekeres theorem for convex sets, A bipartite analogue of Dilworth's theorem, Abstract order type extension and new results on the rectilinear crossing number, Some recent progress and applications in graph minor theory, Induced subgraphs of Ramsey graphs with many distinct degrees, 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 \(\vartheta\)-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, Lexicographic Ramsey theory, Graph minors. IX: Disjoint crossed paths, Two combinatorial problems on posets, Non-Ramsey graphs are \(c\log n\)-universal, Diperfect graphs, On homogeneous sets of positive integers, Cyclic polytopes and oriented matroids, Polymatroid greedoids, Erdős--Szekeres theorem with forbidden order types, Opposite-quadrant depth in the plane, On some monotone path problems in line arrangements, A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\), Finding longest increasing and common subsequences in streaming data, The line analog of Ramsey numbers, Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner, Inequalities and asymptotic bounds for Ramsey numbers, An upper bound for the Ramsey number M(5,4), On a Ramsey type theorem, Generalized Ramsey theory for graphs. I: Diagonal numbers, Crossing patterns of semi-algebraic sets, Expected length of the longest common subsequence for large alphabets, A sharp bound on the size of a connected matroid, Geometria combinatoria e geometrie finite, A partition calculus in set theory, Achievement and avoidance games designed from theorems, Über ein Extremalproblem der Graphentheorie, Ultrafilter Mappings and Their Dedekind Cuts, Ramsey Graphs and Block Designs. I
