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 c logn 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 1: Classification of Surfaces and Graph Embeddings Consider a connected graph G with vertices V and edges E, where G has a genus g. The genus g of a surface is the maximum number of non-intersecting simple closed curves that can be drawn on the surface without separating it. Given this, solve the following: 1. Surface Embedding: Prove that for any g-genus surface, there exists a connected graph that can be embedded on it without edges crossing. Find a method to construct the smallest graph for each genus g such that the graph is planar on a g-genus surface but not on any lower genus surface. 2. Graph Genus Calculation: ⚫ For a complete graph K, calculate the minimum genus surface required for an embedding. Specifically, find an expression in terms of n that represents the genus of a surface on which K, can be embedded.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.7: Distinguishable Permutations And Combinations
Problem 29E
icon
Related questions
Question
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 c logn 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 1: Classification of Surfaces and Graph Embeddings
Consider a connected graph G with vertices V and edges E, where G has a genus g. The genus g
of a surface is the maximum number of non-intersecting simple closed curves that can be drawn on
the surface without separating it. Given this, solve the following:
1. Surface Embedding:
Prove that for any g-genus surface, there exists a connected graph that can be embedded
on it without edges crossing.
Find a method to construct the smallest graph for each genus g such that the graph is
planar on a g-genus surface but not on any lower genus surface.
2. Graph Genus Calculation:
⚫ For a complete graph K, calculate the minimum genus surface required for an
embedding. Specifically, find an expression in terms of n that represents the genus of a
surface on which K, can be embedded.
Transcribed Image Text: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 c logn 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 1: Classification of Surfaces and Graph Embeddings Consider a connected graph G with vertices V and edges E, where G has a genus g. The genus g of a surface is the maximum number of non-intersecting simple closed curves that can be drawn on the surface without separating it. Given this, solve the following: 1. Surface Embedding: Prove that for any g-genus surface, there exists a connected graph that can be embedded on it without edges crossing. Find a method to construct the smallest graph for each genus g such that the graph is planar on a g-genus surface but not on any lower genus surface. 2. Graph Genus Calculation: ⚫ For a complete graph K, calculate the minimum genus surface required for an embedding. Specifically, find an expression in terms of n that represents the genus of a surface on which K, can be embedded.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage