scientific article; zbMATH DE number 3019031
From MaRDI portal
Publication:5759552
zbMath0012.27010MaRDI QIDQ5759552
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
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, On homogeneous sets of positive integers, A note on multicolor Ramsey number of small odd cycles versus a large clique, 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, Erdős--Szekeres theorem with forbidden order types, Opposite-quadrant depth in the plane, On some monotone path problems in line arrangements, Orthogeodesic point-set embedding of trees, Off-diagonal hypergraph Ramsey numbers, A Ramsey property of order types, Approximating the independence number via the \(\vartheta\)-function, Longest monotone subsequences and rare regions of pattern-avoiding permutations, 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, Characterising inflations of monotone grid classes of permutations, The rectangle of influence drawability problem, Off-diagonal ordered Ramsey numbers of matchings, Longest increasing subsequences and log concavity, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, Extremal distances for subtree transfer operations in binary trees, Colouring squares of claw-free graphs, Equiangular lines and spherical codes in Euclidean space, Erdős-Szekeres ``happy end-type theorems for separoïds, The dual diameter of triangulations, Colored ray configurations, Large convex holes in random point sets, Graph minors. XVI: Excluding a non-planar graph, Fundamental limits of exact support recovery in high dimensions, Interior points in the Erdős-Szekeres theorems, Multicolor Ramsey numbers for triple systems, Higher-order Erdős-Szekeres theorems, Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric, The Erdős-Szekeres theorem and congruences, Ramsey numbers and monotone colorings, A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem, Two extensions of the Erdős-Szekeres problem, Edges not in any monochromatic copy of a fixed graph, The maximum agreement subtree problem, Lower bounds for multicolor Ramsey numbers, Cyclic polytopes and oriented matroids, Radicals in skew polynomial and skew Laurent polynomial rings., A limit theorem for sets of stochastic matrices., Almost empty hexagons, 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, Finitely labeled generating trees and restricted permutations, Balanced convex partitions of lines in the plane, A simple proof for open cups and caps, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, A graph with the partial order competition dimension greater than five, LIL for the length of the longest increasing subsequences, A note on the value in the disjoint convex partition problem, An easy subexponential bound for online chain partitioning, 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, A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\), Polymatroid greedoids, On the existence of a point subset with 3 or 6 interior points, Ramsey graphs and block designs, On order types of systems of segments in the plane, Finding longest increasing and common subsequences in streaming data, Forbidden subposet problems for traces of set families, Ramsey numbers for partially-ordered sets, Existence of submatrices with all possible columns, Convexly independent subsets of Minkowski sums of convex polygons, On the Erdős-Szekeres \(n\)-interior-point problem, Saturation problems in the Ramsey theory of graphs, posets and point sets, Weak versions of Ramsey's theorem, The saturation number for the length of degree monotone paths, Finding and counting permutations via CSPs, Simultaneous embedding of colored graphs, Lexicographic Ramsey theory, A superlinear lower bound on the number of 5-holes, Graph minors. IX: Disjoint crossed paths, Two combinatorial problems on posets, Faster counting empty convex polygons in a planar point set, Representing point sets on the plane as permutations, The Wiener index of signed graphs, Ordered size Ramsey number of paths, Non-Ramsey graphs are \(c\log n\)-universal, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, Gallai-Ramsey number of odd cycles with chords, Diperfect graphs, The probability method: Successes and limitations, Ramsey numbers of interval 2-chromatic ordered graphs, Excluding a ladder, Points defining triangles with distinct circumradii, On off-diagonal ordered Ramsey numbers of nested matchings, A note on the upper bound for disjoint convex partitions, An almost optimal bound on the number of intersections of two simple polygons, The Erdős-Hajnal conjecture for three colors and triangles, The dimension of posets with planar cover graphs., Three-monotone interpolation, Hydrodynamical methods for analyzing longest increasing subsequences, Diagonal Ramsey via effective quasirandomness, The minimum degree of minimal Ramsey graphs for cliques, Turán and Ramsey numbers for 3‐uniform minimal paths of length 4, Erdős–Hajnal for graphs with no 5‐hole, On approximations for \(n\) real numbers, Colouring bottomless rectangles and arborescences, Unavoidable patterns in complete simple topological graphs, Counting crucial permutations with respect to monotone patterns, On quantitative aspects of a canonisation theorem for edge‐orderings, Algorithmic obstructions in the random number partitioning problem, Ramsey properties of semilinear graphs, Localized versions of extremal problems, Subsequences in bounded ranges: matching and analysis problems, Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set, Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian, A positive fraction Erdős-Szekeres theorem and its applications, The asymptotics of \(r(4,t)\), Graphs of large chromatic number, Ramsey numbers with prescribed rate of growth, Ramsey numbers of cliques versus monotone paths, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Disjoint empty convex polygons in planar point sets, Crossing patterns of segments, On the Erdős-Szekeres convex polygon problem, On the distribution of the length of the longest increasing subsequence of random permutations, Ramsey properties of algebraic graphs and hypergraphs, Monotone subsets in lattices and the Schensted shape of a Sós permutation, Selection in monotone matrices and computing k th nearest neighbors, Fast Property Testing and Metrics for Permutations, On the decay of the smallest singular value of submatrices of rectangular matrices, A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets, Convex Polygons in Geometric Triangulations, Independent sets in graphs without subtrees with many leaves, Ramsey-type results for semi-algebraic relations, Unnamed Item, Hilbert’s Proof of His Irreducibility Theorem, Tverberg-type theorems with altered intersection patterns (nerves), A General Framework for Hypergraph Coloring, Geometria combinatoria e geometrie finite, A Precise Threshold for Quasi-Ramsey Numbers, Orthogeodesic Point-Set Embedding of Trees, Upper Bound Constructions for Untangling Planar Geometric Graphs, Every Graph Admits an Unambiguous Bold Drawing, Broadcast Transmission to Prioritizing Receivers, On Ramsey Type Problems in Combinatorial Geometry, On the Erdős–Szekeres problem in combinatorial geometry, A partition calculus in set theory, Unnamed Item, ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY, A Note on the Number of General 4-holes in (Perturbed) Grids, The Mathematics of Ferran Hurtado: A Brief Survey, The number of additive triples in subsets of abelian groups, Increasing subsequences of random walks, Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Monotone Subsequences in High-Dimensional Permutations, Induced Subgraphs With Many Distinct Degrees, Minimum Number of Monotone Subsequences of Length 4 in Permutations, On five types of crucial permutations with respect to monotone patterns, Unnamed Item, Large Unavoidable Subtournaments, On geometric graphs on point sets in the plane, Empty squares in arbitrary orientation among points, Construction and Local Routing for Angle-Monotone Graphs, Ramsey numbers of ordered graphs, A SAT attack on the Erdős-Szekeres conjecture, Ordered Ramsey numbers, String graphs and incomparability graphs, Colouring Squares of Claw-free Graphs, A sharp bound on the size of a connected matroid, Distinct degrees in induced subgraphs, On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets, The Parameterized Complexity of Finding Point Sets with Hereditary Properties, Induced Turán Numbers, Specified holes with pairwise disjoint interiors in planar point sets, Paul Erdős, 1913-1996, A SAT attack on the Erdős-Szekeres conjecture, Induced Ramsey-type theorems, Induced Ramsey-type theorems, On a theorem of Erdős and Szekeres, Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics, Unnamed Item, On a combinatorial game, Untangling polygons and graphs, Über ein Extremalproblem der Graphentheorie, Hypergraph Ramsey numbers, Unnamed Item, Approximating maximum independent sets by excluding subgraphs, Unnamed Item, Induced Ramsey-type results and binary predicates for point sets, Graphs with Large Obstacle Numbers, Regular systems of paths and families of convex sets in convex position, Triangular Ramsey Numbers, A generalization of primitive sets and a conjecture of Erd\H{o}s, More on planar point subsets with a specified number of interior points, Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs, On Erdős-Szekeres-type problems for \(k\)-convex point sets, The line analog of Ramsey numbers, Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner, Ramsey, Paper, Scissors, Ultrafilter Mappings and Their Dedekind Cuts, On the Size-Ramsey Number of Cycles, Large Area Convex Holes in Random Point Sets, Ramsey Graphs and Block Designs. I, The Erdős-Szekeres Problem, Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs, Inequalities and asymptotic bounds for Ramsey numbers, An upper bound for the Ramsey number M(5,4), Rollercoasters: Long Sequences without Short Runs, Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design, On a Ramsey type theorem, Generalized Ramsey theory for graphs. I: Diagonal numbers, Proof of a conjecture on induced subgraphs of Ramsey graphs, Crossing patterns of semi-algebraic sets, Achievement and avoidance games designed from theorems, Squared Chromatic Number Without Claws or Large Cliques, On Erdős-Szekeres-type problems, Expected length of the longest common subsequence for large alphabets, Book Embeddings of Regular Graphs, Fractional Chromatic Number, Maximum Degree, and Girth, An upper bound for Ramsey numbers, Concerning a Certain Set of Arrangements, Partition relations for cardinal numbers, Ramsey numbers of cycles versus general graphs
