Kaiyang Lan

3 Questions 1 Answers 0 Followers

Questions related from Kaiyang Lan

Is there a structural characterization of Berge graphs with no antihole of length at least six?

This question was posed by Nicolas Trotignon, where a graph is Berge if it does not contain an odd hole nor an odd antihole.

12 August 2023 8,147 0 View

Holes in a graph：Let f(n) be the largest chromatic number of a graph with no holes of length at least 5 and clique number n. Can we determine f(4)?

This question is posed by V. Sivaraman in 2018. Clearly f(1) = 1 and f(2) = 2. It is known from [3] that f(3) = 4. Determine f(n) for all n≥4. [3] M. Chudnovsky, N. Robertson, P. Seymour, and R....

05 August 2023 5,731 0 View

Is it true that every d-regular simple graph on n vertices, with n even and d≥n/2, is d-edge-colorable?

This is the 59th question of the 100 questions compiled by J.A. Bondy, proposed by Hilton in 1989.

04 August 2023 1,551 1 View