The bowtie three-in-or-three-out conjecture

About 1 year old · traced to

Let B=F2,3B=F_{2,3} be the bowtie graph, with a distinguished center vertex, and let B⃗\vec{B} be an orientation of BB having exactly three edges directed toward the center vertex or exactly three edges directed away from it. The bowtie three-in-or-three-out conjecture. Then

D(n,B⃗)=2ex(n,B).D(n,\vec{B})=2^{\mathrm{ex}(n,B)}.

This is the remaining unresolved orientation case after the other bowtie orientations were shown to have more than 2ex(n,B)2^{\mathrm{ex}(n,B)} orientations; whether the displayed equality holds remains open.

References

Primary source

Hannah Sheats, “Orientations of graphs omitting non-edge-critical directed graphs”, arXiv:2502.21287 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.