Fulek's Question on the Extremal Function of L_3
Statement
Fulek defined a weight-five three-row - matrix and asked whether . It is: every matrix avoiding has at most ones, so for . The same argument covers an infinite family of light three-row patterns, verifying a conjecture of Pettie and Tardos on linear light patterns for that family.
Context
the companion pattern Fulek proposed alongside L_3 is not covered by this method
A named question from a 2009 Discrete Mathematics paper, and the previously unresolved weight-five case of the Pettie-Tardos linear light pattern conjecture.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The acknowledgement says the two systems were used for proof exploration, proof criticism, exposition and revision, with no specific step attributed, so the lowest tier applies.
the companion pattern Fulek proposed alongside L_3 is not covered by this method
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.