Pages that link to "Item:Q5164032"

The following pages link to Constructing dense grid-free linear $3$-graphs (Q5164032):

Displaying 4 items.

• A new bound for the Brown-Erdős-Sós problem (Q2101162) (← links)
• The linear Turán number of small triple systems or why is the wicket interesting? (Q2166284) (← links)
• The Turán number of the grid (Q6176592) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)