Instructions: 1. Give geometric interpretation and graphs where required. 2. Give your original work. 3. Use the recommended references and books. Abbott H.L., Lower bounds for some Ramsey numbers. Discr. Math. 2 (1972), 289-293. [393] Abeledo H. and G. Isaak, A characterization of graphs that ensure the existence of a stable matching. Math. Soc. Sci. 22 (1991), 93-96. [136] Aberth O., On the sum of graphs. Rev. Fr. Rech. Opér. 33 (1964), 353-358. [194] Acharya B.D. and M. Las Vergnas, Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality. J. Comb. Th. B 33 (1982), 52–56. [327] Ahuja R.K., T.L. Magnanti, and J.B. Orlin, Network Flows. Prentice Hall (1993). [97, 145, 176, 180, 185, 190] Aigner M., Combinatorial Theory. Springer-Verlag (1979). [355, 360, 373] Aigner M., Graphentheorie. Eine Entwicklung aus dem 4-Farben Problem. B.G. Teubner Verlagsgesellschaft (1984) (English transl. BCS Assoc., 1987). [258] Ajtai M., V. Chvátal, M.M. Newborn and E. Szemerédi, Crossing-free subgraphs. Theory and practice of combinatorics, Ann. Discr. Math. 12 (1982), 9-12. [264] Ajtai M., J. Komlós, and E. Szemerédi, A note on Ramsey numbers. J. Comb. Th (A) 29 (1980), 354-360. [51, 385] Ajtai M., J. Komlós, and E. Szemerédi, Sorting in clog parallel steps. Combi- natorica 3 (1983), 1-19. [463] Akiyama J., H. Era, S.V. Gervacio and M. Watanabe, Path chromatic numbers of graphs. J. Graph Th. 13 (1989), 569-575. [271] Akiyama J, and F. Harary, A graph and its complement with specified properties, IV: Counting self-complementary blocks. J. Graph Th. 5 (1981), 103-107. [32] Albertson M.O. and E.H. Moore, Extending graph colorings. J. Comb. Th. (B) 77 (1999), 83–95. [204] Alekseev V.B. and V.S. Gončakov, The thickness of an arbitrary complete graph (Russian). Mat. Sb. (N.S.) 101(143) (1976), 212-230. [271] No AI, AI means Downvote. Problem 2: Geometric Graph Properties on Non-Orientable Surfaces A non-orientable surface, such as the Möbius strip or the Klein bottle, introduces unique challenges in geometric graph theory. 1. Non-Orientable Graph Embeddings: • Prove that any graph that can be embedded on a non-orientable surface with g-handles (e.g., a Klein bottle) has a different crossing number than on an orientable surface. Quantify this difference in terms of g and the graph's vertex and edge count. 2. Klein Bottle Embedding: ⚫ Derive an explicit method to embed the complete bipartite graph K3,3 on a Klein bottle without edge crossings. Prove that this embedding is possible and demonstrate how the Möbius property affects the embedding. 3. Euler Characteristic Generalization: • Prove that the Euler characteristic X for a graph embedded on a non-orientable surface is x= |V|-|E|+|F|=2-2g-n. where n is the number of "twists" or non- orientable elements. Apply this to the graph Ks and determine whether it can be embedded on a Möbius strip without edge crossings. 4. Coloring on Non-Orientable Surfaces: •Prove that the chromatic number for a non-orientable surface with genus g is at most g+ 2. Use this result to derive the chromatic number of a specific geometric graph embedded on a Möbius strip or Klein bottle.

Instructions: 1. Give geometric interpretation and graphs where required. 2. Give your original work. 3. Use the recommended references and books. Abbott H.L., Lower bounds for some Ramsey numbers. Discr. Math. 2 (1972), 289-293. [393] Abeledo H. and G. Isaak, A characterization of graphs that ensure the existence of a stable matching. Math. Soc. Sci. 22 (1991), 93-96. [136] Aberth O., On the sum of graphs. Rev. Fr. Rech. Opér. 33 (1964), 353-358. [194] Acharya B.D. and M. Las Vergnas, Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality. J. Comb. Th. B 33 (1982), 52–56. [327] Ahuja R.K., T.L. Magnanti, and J.B. Orlin, Network Flows. Prentice Hall (1993). [97, 145, 176, 180, 185, 190] Aigner M., Combinatorial Theory. Springer-Verlag (1979). [355, 360, 373] Aigner M., Graphentheorie. Eine Entwicklung aus dem 4-Farben Problem. B.G. Teubner Verlagsgesellschaft (1984) (English transl. BCS Assoc., 1987). [258] Ajtai M., V. Chvátal, M.M. Newborn and E. Szemerédi, Crossing-free subgraphs. Theory and practice of combinatorics, Ann. Discr. Math. 12 (1982), 9-12. [264] Ajtai M., J. Komlós, and E. Szemerédi, A note on Ramsey numbers. J. Comb. Th (A) 29 (1980), 354-360. [51, 385] Ajtai M., J. Komlós, and E. Szemerédi, Sorting in clog parallel steps. Combi- natorica 3 (1983), 1-19. [463] Akiyama J., H. Era, S.V. Gervacio and M. Watanabe, Path chromatic numbers of graphs. J. Graph Th. 13 (1989), 569-575. [271] Akiyama J, and F. Harary, A graph and its complement with specified properties, IV: Counting self-complementary blocks. J. Graph Th. 5 (1981), 103-107. [32] Albertson M.O. and E.H. Moore, Extending graph colorings. J. Comb. Th. (B) 77 (1999), 83–95. [204] Alekseev V.B. and V.S. Gončakov, The thickness of an arbitrary complete graph (Russian). Mat. Sb. (N.S.) 101(143) (1976), 212-230. [271] No AI, AI means Downvote. Problem 2: Geometric Graph Properties on Non-Orientable Surfaces A non-orientable surface, such as the Möbius strip or the Klein bottle, introduces unique challenges in geometric graph theory. 1. Non-Orientable Graph Embeddings: • Prove that any graph that can be embedded on a non-orientable surface with g-handles (e.g., a Klein bottle) has a different crossing number than on an orientable surface. Quantify this difference in terms of g and the graph's vertex and edge count. 2. Klein Bottle Embedding: ⚫ Derive an explicit method to embed the complete bipartite graph K3,3 on a Klein bottle without edge crossings. Prove that this embedding is possible and demonstrate how the Möbius property affects the embedding. 3. Euler Characteristic Generalization: • Prove that the Euler characteristic X for a graph embedded on a non-orientable surface is x= |V|-|E|+|F|=2-2g-n. where n is the number of "twists" or non- orientable elements. Apply this to the graph Ks and determine whether it can be embedded on a Möbius strip without edge crossings. 4. Coloring on Non-Orientable Surfaces: •Prove that the chromatic number for a non-orientable surface with genus g is at most g+ 2. Use this result to derive the chromatic number of a specific geometric graph embedded on a Möbius strip or Klein bottle.

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter4: Polynomial And Rational Functions

Section4.1: Polynomial Functions Of Degree Greater Than

Problem 54E

See similar textbooks