Large Inducibility Conjecture for nontrivial graphs
Statement
For a finite graph , let denote its inducibility, and let and be respectively the complete and edgeless graphs on vertices. The Large Inducibility Conjecture.
The conjecture is presented as an analogue for graph inducibilities of the Edge-statistics Conjecture and would be implied by it. The known lower bounds include nontrivial graphs with inducibility approaching , while the matching universal upper bound remains open.
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.