Proposed by Ashwin Sah Problem 4.
Statement
Proposed by Ashwin Sah Problem 4. Let tp pF, Gq “ p´epF q |G|´|F | hompF, Gq, the p-normalized homomorphism count of F within graph G. Is it possible to con- struct a sequence of graphs Gn with |Gn | Ñ 8‘ with edge densities pn “ |Gn |´op1q such that: (1) aF “ limnÑ8 tpn pF, Gn q exists for every graph F (2) aC4 “ 1 (3) aK3 “ 1 1{e (4) supF aF F ă 8 (5) aF ‰ 1 for some F} Noga Alon Problem 5. Given graphs G1 and G2 on the vertex set rns define G1 ‘ G2 “ prns, E1 ‘ E2 q. Let F be a family of graphs on the vertex set rns such that for any distinct pair of graph F1 and F2 we have that F1 ‘ F2 is not a clique. Prove (or disprove) that ˆ ˙ n |F | “ o 2 p 2 q .}
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.