Extremal theory of vertex or edge ordered graphs
From MaRDI portal
Recommendations
- EXTREMAL THEORY OF ORDERED GRAPHS
- scientific article; zbMATH DE number 863492
- scientific article; zbMATH DE number 2123255
- scientific article; zbMATH DE number 3841900
- scientific article; zbMATH DE number 3191789
- scientific article; zbMATH DE number 3258067
- Extremal graph theory for degree sequences
- Extremal graph theory and finite forcibility
- Selected Topics in the Extremal Graph Theory
- Extremal infinite graph theory
Cited in
(18)- Statistics of orderings
- Extremal problems for ordered hypergraphs: small patterns and some enumeration
- Tilings in vertex ordered graphs
- Edge-ordered Ramsey numbers
- On the abstract chromatic number and its computability for finitely axiomatizable theories
- Turán problems for edge-ordered graphs
- Counting ordered graphs that avoid certain subgraphs
- Extremal graphs of order dimension 4
- Dirac-type results for tilings and coverings in ordered graphs
- EXTREMAL THEORY OF ORDERED GRAPHS
- On the Turán number of ordered forests
- On the Turán number of ordered forests
- Saturation of Ordered Graphs
- Extremal graphs with given order and the rupture degree
- Monochromatic spanning trees and matchings in ordered complete graphs
- Edge ordered Turán problems
- Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
- On computational aspects of cores of ordered graphs
This page was built for publication: Extremal theory of vertex or edge ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149172)
