What is the maximum number ex(H, G, n) of H-subgraphs contained in an n-vertex graph in G?
Statement
What is the maximum number ex(H, G, n) of H-subgraphs contained in an n-vertex graph in G? Homomorphism counts in robustly sparse graphs Chun-Hung Liu
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.