Faudree–Gyárfás–Schelp star-forest ascending decomposition conjecture
Let be a graph with edges. An ascending subgraph decomposition is a decomposition in which has edges and is a subgraph of for each . A star forest is a forest whose connected components are stars. Faudree–Gyárfás–Schelp conjecture. Every graph with edges has an ascending subgraph decomposition in which every is a star forest. The paper establishes the broader ascending decomposition conjecture but leaves open whether the decomposition can always be chosen entirely from star forests.
References
Primary source
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy and Benny Sudakov, “Ascending Subgraph Decomposition”, arXiv:2308.11613 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.