Search

In 1940, in attempts to solve the Four Color Problem, Henry Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P5 of 3-polytopes with minimum degree 5. This description depends on 32 main parameters. (6; 6; 7; 7; 7), (6; 6; 6; 7; 9), (6; 6; 6; 6; 11), (5; 6; 7; 7; 8), (5; 6; 6; 7; 12), (5; 6; 6; 8; 10), (5; 6; 6; 6; 17), (5; 5; 7; 7; 13), (5; 5; 7; 8; 10), (5; 5; 6; 7; 27), (5; 5; 6; 6;1), (5; 5; 6; 8; 15), (5; 5; 6; 9; 11), (5; 5; 5; 7; 41), (5; 5; 5; 8; 23), (5; 5; 5; 9; 17), (5; 5; 5; 10; 14), (5; 5; 5; 11; 13). Not many precise upper bounds on these parameters have been obtained as yet, even for restricted subclasses in P5. In 2018, Borodin, Ivanova, Kazak proved that every forbidding vertices of degree from 7 to 11 results in a tight description (5; 5; 6; 6;1), (5; 6; 6; 6; 15), (6; 6; 6; 6; 6). Recently, Borodin, Ivanova, and Kazak proved every 3-polytope in P5 with no vertices of degrees 6, 7, and 8 has a 5-vertex whose neighborhood is majorized by one of the sequences (5; 5; 5; 5;1) and (5; 5; 10; 5; 12), which is tight and improves a corresponding description (5; 5; 5; 5;1), (5; 5; 9; 5; 17), (5; 5; 10; 5; 14), (5; 5; 11; 5; 13) that follows from the Lebesgue Theorem. [ABSTRACT FROM AUTHOR]