Stuck on Proofs in Discrete Mathematics?

Click For Summary
SUMMARY

This discussion focuses on solving specific proofs in discrete mathematics, particularly regarding the Grötzsch graph's non-3-colorability, the non-planarity of the K5,5 graph, and a set theory equation involving unions and differences. The user seeks guidance on proof techniques, including proof by contradiction and proof by cases. Key concepts include the properties of graph colorability and planarity, as well as set operations.

PREREQUISITES
  • Understanding of graph theory concepts such as colorability and planarity.
  • Familiarity with proof techniques, specifically proof by contradiction and proof by cases.
  • Knowledge of set theory operations, including unions and differences.
  • Basic understanding of discrete mathematics principles.
NEXT STEPS
  • Research the properties of the Grötzsch graph and its implications for graph colorability.
  • Study the proof techniques for demonstrating graph non-planarity, particularly for K5,5.
  • Explore set theory proofs, focusing on proving set equality through element inclusion.
  • Learn about advanced topics in discrete mathematics, such as combinatorial proofs and graph theory applications.
USEFUL FOR

Students of discrete mathematics, mathematicians focusing on graph theory, and anyone seeking to improve their proof-writing skills in mathematical contexts.

thrive
Messages
19
Reaction score
0
Hello all,

I am stuck on some homework, basically I am stuck on the problems dealing with proofs. I am not asking for complete answers just any direction would be helpful.

1) I have to prove the Grötzsch graph is not 3-colorable (vertex can be colored in such a way that no edge shares 2 vertices with the same color) using proof by contradiction. So far I have, "assume the Grotzsch graph is 3- colorable, then there exists a configuration such that the graphs' edge endpoints share the same color." I'm confused on what to do next, how to continue the proof.

http://upload.wikimedia.org/wikiped...ötzsch_graph.svg/480px-Grötzsch_graph.svg.png

2) Prove that the 5 K graph ( sometimes called K 5,5 ) graph is not planar by proof by cases.
I started off proving that its not planar but planar means that the graph cannot possibly be rearranged such that no edges cross.

3) (B − A) ∪ (C − A) = (B ∪ C) − A
Let A, B, and C be any set. I have that x is an element of both the left and right side. I know I have to start off by assuming x is an element of [(B − A) ∪ (C − A)] however I'm not sure what to do next or how to prove its an element of both sides of the equation.

Any help to move forward in my problems would be awsome.
 
Last edited:
Physics news on Phys.org
no help?
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
16K
  • · Replies 23 ·
Replies
23
Views
7K