6 citations · 8 across the 4 of their papers we have counts for
4 papers
On the local structure of oriented graphs -- a case study in flag algebras
Shoni Gilboa, Roman Glebov, Dan Hefetz +2
Let be an -vertex oriented graph. Let (respectively ) be the probability that a random set of vertices of spans a transitive triangle (respectively an i…
On the number of 4-cycles in a tournament
Nati Linial, Avraham Morgenstern
If is an -vertex tournament with a given number of -cycles, what can be said about the number of its -cycles? The most interesting range of this problem is where i…
Graphs with few 3-cliques and 3-anticliques are 3-universal
Nati Linial, Avraham Morgenstern
For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here…
On high-dimensional acyclic tournaments
Nati Linial, Avraham Morgenstern
We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of -dimensional -vertex acyclic tour…