Prefer a chat interface with context about you and your work?
The maximum number of paths of length three in a planar graph
Abstract Let denote the maximum number of copies of possible in an ‐vertex planar graph. The function has been determined when is a cycle of length 3 or 4 by Hakimi and Schmeichel and when is a complete bipartite graph with smaller part of size 1 or 2 by Alon …