REVIEW 2 cited by
Restricted subgraphs of edge-colored graphs and applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding rainbow subgraphs or other restricted structures in edge-colored graphs has a long history, dating back to Euler's work on Latin squares. It has also proven to be a powerful method for studying several well-known questions in other areas. In this survey, we will provide a brief introduction to this topic, discuss several results in this area, and demonstrate their applications to problems in graph decomposition, additive combinatorics, theoretical computer science, and coding theory.
Forward citations
Cited by 2 Pith papers
-
A proof of Andersen's rainbow path conjecture for large $n$
For all sufficiently large n, every properly edge-coloured n-vertex complete graph has a rainbow path on n-1 vertices, resolving Andersen's conjecture and its Latin-square analogue for large n.
-
Recent progress in graph theory using expansion
Sublinear expansion—weak neighbourhood growth in sparse graphs—has resolved many long-standing extremal graph theory conjectures, and this survey organizes that progress.
Discussion (0). Continue with ORCID to comment.