Combinatorics and Graph Theory

2005 Submissions

[4] viXra:2005.0259 [pdf] submitted on 2020-05-26 22:36:52

Pictures Instead of Formulae?

Authors: Valery Skorobogatov
Comments: 8 Pages. in Russian

It is suggested to use the pictures together with the mathematical formulae in physics.
Category: Combinatorics and Graph Theory

[3] viXra:2005.0107 [pdf] submitted on 2020-05-09 10:21:06

Self-Developing Structures (Саморазвивающиеся структуры)

Authors: Franz Hermann
Comments: Pages.

In memory of John Conway. New modification of the game "Life". Памяти Джона Конвея.Новая модификация игры "Жизнь".
Category: Combinatorics and Graph Theory

[2] viXra:2005.0074 [pdf] replaced on 2020-06-07 13:18:16

La (-1)-Reconstruction Des Graphes Symétriques à au Moins 3 éléments

Authors: Mohamed sghiar
Comments: 8 Pages. French and accepted version

In this article, by algebraic and geometrical techniques, I give a proof to the famous Ulam's conjecture on the (-1)-reconstruction of the symmetric graphs with at least 3 elements conjectured in 1942, although was published only in 1960.
Category: Combinatorics and Graph Theory

[1] viXra:2005.0073 [pdf] submitted on 2020-05-06 09:07:23

Action Adjointe Sur Les Graphes et la Preuve de la Conjecture P=NP

Authors: Mohamed Sghiar
Comments: 10 Pages. Submited, Frensh version

I study the link between the adjoint action and the Hamiltonian cycles in a symmetric graph. Then by a simple algebraic resolution of a system of equations with several variables I find all the Hamiltonian cycles of the graph. Finally I will apply the results found to give an algorithm of order $ \mathcal{ O } (n ^ 3 ) $ allowing to quickly give all the Hamiltonian cycles with their distance. This gives a proof of the conjecture $ P = NP $.
Category: Combinatorics and Graph Theory