Turán problems for oriented graphs
From MaRDI portal
Recommendations
Cites work
- Algorithmic Solution of Extremal Digraph Problems
- Cycles of even length in graphs
- Ein kombinatorischer Satz.
- Extremal problems for directed graphs
- Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
- Homomorphisms and colourings of oriented graphs: an updated survey
- scientific article; zbMATH DE number 1185319 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- scientific article; zbMATH DE number 3333210 (Why is no real title available?)
- On a Problem in Graph Theory
- On a problem of K. Zarankiewicz
- On pancyclic digraphs
- On the structure of linear graphs
- Powers of paths in tournaments
- Ramsey numbers for tournaments
- Ramsey numbers of sparse digraphs
- Ramsey-type theorems
- Ramsey-type theorems with forbidden subgraphs
- The history of degenerate (bipartite) extremal graph problems
- The Turán number of blow-ups of trees
- The Voting Problem
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
This page was built for publication: Turán problems for oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644281)