On the local structure of oriented graphs -- a case study in flag algebras
DOI10.37236/10694zbMath1496.05086arXiv1908.06480OpenAlexW4288261357MaRDI QIDQ2170792
Avraham Morgenstern, Roman Glebov, Shoni Gilboa, Nathan Linial, Dan Hefetz
Publication date: 6 September 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.06480
Extremal problems in graph theory (05C35) Semidefinite programming (90C22) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- A problem of Erdős on the minimum number of \(k\)-cliques
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Graph removal lemmas
- The Voting Problem
- On Sets of Acquaintances and Strangers at any Party
- The Algorithmic Aspects of the Regularity Lemma
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Flag algebras
- On the 3‐Local Profiles of Graphs
This page was built for publication: On the local structure of oriented graphs -- a case study in flag algebras