T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.
T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter3: Functions And Graphs
Section3.3: Lines
Problem 10E
Related questions
Question
![T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an
independent set and m(G) = |E(G)|.
(i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The
neighborhood of a vertex in a triangle free graph must be independent; all edges have at least
one end in a vertex cover.
(ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you
may need to use either elementary calculus or the arithmetic-geometric mean inequality.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4a1c925e-790f-448e-9276-e5adcf0e8758%2F14537d70-8bf0-4767-a5c2-08d8b5eec9b2%2Fm6f0i5_processed.png&w=3840&q=75)
Transcribed Image Text:T1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an
independent set and m(G) = |E(G)|.
(i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The
neighborhood of a vertex in a triangle free graph must be independent; all edges have at least
one end in a vertex cover.
(ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you
may need to use either elementary calculus or the arithmetic-geometric mean inequality.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Algebra
ISBN:
9781680331141
Author:
HOUGHTON MIFFLIN HARCOURT
Publisher:
Houghton Mifflin Harcourt