REVIEW 1 cited by
The regularity method for graphs and digraphs
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
abstract
This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that every sufficiently large oriented graph on $n$ vertices with minimum in- and outdegree at least $3n/8 +o(n)$ contains any orientation of a Hamilton cycle. We use Kelly's arguments to extend his result to any robustly expanding digraph of linear degree.
Forward citations
Cited by 1 Pith paper
-
On the supersaturation of oriented Tur\'an problems
Oriented graphs that exceed the oriented Turán density contain a positive fraction of the possible copies of the forbidden oriented subgraph, with explicit bounds for transitive tournaments and antidirected complete b...
Discussion (0). Continue with ORCID to comment.