Asymptotic scarcity of Legendre cordial labelings for complete graphs
Statement
Let be the complete graph on vertices. For an integer , let be the set of primes for which is a Legendre cordial graph modulo , and let . Asymptotic scarcity conjecture. For any integer ,
Computations indicate that the number of primes up to a fixed bound for which a complete graph admits a Legendre cordial labeling decreases as the graph order grows, while the stated limit remains unproved.
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.