REVIEW 4 cited by
Inducibility of 4-vertex tournaments
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal construction. It is an unbalanced blow-up of an edge, where the sink vertex is replaced by a quasi-random tournament and the source vertex is iteratively replaced by a copy of the construction itself.
Forward citations
Cited by 4 Pith papers
-
Maximizing directed cycles in tournaments
For tournaments on n vertices, the maximum number of directed 4k-cycles is asymptotic to (1 + 2 times the sum from i=1 to infinity of (2/((2i-1)pi))^(4k)) times the random tournament's count, attained by the carousel ...
-
Generalized Tur\'an problem for directed cycles
The maximum number of directed k-cycles in an n-vertex oriented graph with no directed l-cycle is Theta(n^k) when k does not divide l, Theta(n^(k-1)) when k divides l, and the leading constant is determined for large l.
-
The semi-inducibility problem
The authors determine sharp or almost sharp maximum densities for alternating walks and cycles and for every 4-cycle colour pattern in red-blue complete graphs, and exhibit a positive-coefficient quantum graph whose o...
-
Forcing Quasirandomness in a Regular Tournament
All tournaments on at most five vertices that force quasirandomness in nearly regular tournaments are classified: eleven force it and nine do not.
Discussion (0). Continue with ORCID to comment.