Forbidden paths and cycles in ordered graphs and matrices
From MaRDI portal
Recommendations
Cites work
- An Extremal Problem on Sparse 0-1 Matrices
- Combinatorial complexity bounds for arrangements of curves and spheres
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Davenport-Schinzel theory of matrices
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- On 0-1 matrices and small excluded submatrices
- On the number of permutations avoiding a given pattern
- On the self crossing six sided figure problem
- On the structure of linear graphs
- The maximum number of unit distances in a convex n-gon
Cited in
(55)- On the Turán number of some ordered even cycles
- Bounds on parameters of minimally nonlinear patterns
- Partitioning ordered hypergraphs
- Extremal problems for pairs of triangles
- Tilings in vertex ordered graphs
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Ramsey numbers of interval 2-chromatic ordered graphs
- Shadows of ordered graphs
- Equal entries in totally positive matrices
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- Bipartite Turán problems for ordered graphs
- Turán problems for edge-ordered graphs
- Counting ordered graphs that avoid certain subgraphs
- Interval minors of complete bipartite graphs
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
- On unit distances in a convex polygon
- Saturation problems about forbidden 0-1 submatrices
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- Dirac-type results for tilings and coverings in ordered graphs
- On the chromatic number of disjointness graphs of curves
- Simple Paths and Cycles Avoiding Forbidden Paths
- Semantic limits of dense combinatorial objects
- scientific article; zbMATH DE number 7407637 (Why is no real title available?)
- A tournament approach to pattern avoiding matrices
- Forbidden patterns and unit distances
- scientific article; zbMATH DE number 7053339 (Why is no real title available?)
- Large homogeneous submatrices
- An exact characterization of saturation for permutation matrices
- Ordered Ramsey numbers
- On the Turán number of ordered forests
- Ramsey numbers of ordered graphs
- On the Turán number of ordered forests
- Excluded permutation matrices and the Stanley-Wilf conjecture
- On asymptotic packing of convex geometric and ordered graphs
- Saturation of Ordered Graphs
- List-3-coloring ordered graphs with a forbidden induced subgraphs
- On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
- Turán numbers of ordered tight hyperpaths
- Orientation of convex sets
- Online Ramsey numbers of ordered paths and cycles
- On paths avoding forbidden pairs of vertices in a graph
- On computational aspects of ordered matching problems
- On Turán-type problems and the abstract chromatic number
- On the number of digons in arrangements of pairwise intersecting circles
- Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications
- On edge-ordered graphs with linear extremal functions (extended abstract)
- On ordered Ramsey numbers of matchings versus triangles (extended abstract)
- Ordered Ramsey numbers for the union of graphs
- On computational aspects of cores of ordered graphs
- Forbidden patterns in mixed linear layouts
- On the chromatic number of disjointness graphs of curves
- Almost all permutation matrices have bounded saturation functions
This page was built for publication: Forbidden paths and cycles in ordered graphs and matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472738)
