Exact identities and rounding loss for induced directed paths
Statement
Conjecture 6. 3 2. (Thomass´ e) If G is a loopless digon-free digraph the maximum number of induced directed 2-edge paths is n3/15 + O(n2).Notes: First, note that n3/15 + O(n2) can be obtained by substituting C4's inside C4's. Next, given a digraph G, let τ be the number of induced directed 2-paths, η the number of induced edges, and θ the number of cyclic triangles. Then if |V (G)| = n,
τ + η/ 3 + 2 θ = n3/12 + O(n2) − 1
6
∑
v∈V(G)
(
(δ+(v) − δ−(v)) 2 + ( n
2 − δ+(v)) 2 + ( n
2 − δ−(v)) 2
).
F¨ uredi rewrote the terms on the right hand side in terms of τ, η, and θ, and showed
τ ≤ n3
12 + O(n2).
Bondy has a slight improvement of this result, proving that
τ ≤ 2n3
Define an α/β-digraph to be a digraph D on vertex set V and edges defined by σ1,..., σ β
permutations (linear orders) on V where the edge ( i, j ) ∈ E ⇐⇒ i < j in at least α of the σi.We say G is a majority digraph if α
β
2/3.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.