Pages that link to "Item:Q5069262"
From MaRDI portal
The following pages link to ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE (Q5069262):
Displaying 4 items.
- The number of 4-cycles in a graph (Q2671849) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← links)
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 (Q6101105) (← links)