feat(ErdosProblems/1105): anti-Ramsey numbers for cycles and paths #1578
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file introduces the Erdős Problem 1105, detailing conjectures related to anti-Ramsey numbers for cycles and paths. It includes definitions for edge coloring, rainbow subgraphs, and the anti-Ramsey number, along with theorems related to these conjectures.
Paul-Lez
reviewed
Jan 9, 2026
| SimpleGraph.fromRel fun i j => i.val + 1 = j.val ∨ j.val + 1 = i.val | ||
|
|
||
| /-- An edge coloring of a simple graph `G` with color type `α`. -/ | ||
| def EdgeColoring (G : SimpleGraph V) (α : Type*) := G.edgeSet → α |
Member
There was a problem hiding this comment.
Note: this exists in upstream Mathlib as SimpleGraph.EdgeLabeling
|
|
||
| /-- The anti-Ramsey number AR(n, H) is the maximum number of colors in which the edges of Kₙ | ||
| can be colored without creating a rainbow copy of H. -/ | ||
| noncomputable def antiRamseyNumber (n : ℕ) (H : SimpleGraph W) : ℕ := |
Member
There was a problem hiding this comment.
I think this would be a good definition to have in ForMathlib.
Co-authored-by: Paul Lezeau <[email protected]>
YaelDillies
changed the title
YaelDillies
added
ams-05: Combinatorics
awaiting-author
Author
|
Should I move antiRamseyNumber def to ForMathlib? @YaelDillies @mo271 |
Collaborator
|
Yes please! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This file introduces the Erdős Problem 1105, detailing conjectures related to anti-Ramsey numbers for cycles and paths. It includes definitions for edge coloring, rainbow subgraphs, and the anti-Ramsey number, along with theorems related to these conjectures.