Pages that link to "Item:Q1853125"
From MaRDI portal
The following pages link to Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125):
Displaying 3 items.