Set Theory and Logic

1204 Submissions

[4] viXra:1204.0030 [pdf] submitted on 2012-04-08 14:42:29

Solution for Hadwiger Conjecture

Authors: Wilber Valgusbitkevyt
Comments: 2 Pages.

Reverse Modus Ponens followed by set theory using lines followed by considering the maximum number of colours that can be used using graph homomorphism.
Category: Set Theory and Logic

[3] viXra:1204.0012 [pdf] replaced on 2012-04-04 14:58:56

Solution for Ringel-Kotzig Conjecture

Authors: Wilber Valgusbitkevyt
Comments: 5 Pages. Further elaboration on Victoria Hayanisel Theorems were explained.

In this paper, I am creating three new theorems called Victoria Hayanisel Theorem dedicated to Princess Eugenie of York to describe the state of numbers, circles, and lines. Followed by the theorem, I am using the set theory and Fermat's Infinite Descent Method (if my method is different, I will name it) to show how the conjecture is true.
Category: Set Theory and Logic

[2] viXra:1204.0011 [pdf] submitted on 2012-04-03 20:03:25

Solution to Collatz Conjecture

Authors: Wilber Valgusbitkevyt
Comments: 2 Pages.

There is a pattern for the arbitary sequence which can be divided into four groups to be formalized as a recursive formula which shows the conjecture is true.
Category: Set Theory and Logic

[1] viXra:1204.0009 [pdf] submitted on 2012-04-03 20:08:46

Solution for Erdős–Faber–Lovász Conjecture

Authors: Wilber Valgusbitkevyt
Comments: 2 Pages.

Translate the graph into sets by using the shared vertexes as indexes. Then consider several different cases to see how the conjecture is true in each case.
Category: Set Theory and Logic