Related papers: From the 1-2-3 Conjecture to the Riemann Hypothesi…
In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
Using algebraic transformations and equivalent reformulations we derive a number of new results from some earlier ones (by the author) in more accepted terms closely related to well-known conjectures of Bondy and Jung including a number of…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We give a short Wiener measure proof of the Riemann hypothesis based on a surprising, unexpected and deep relation between the Riemann zeta $\zeta(s)$ and the trivial zeta $\zeta_{t}(s):=Im(s)(2Re(s)-1)$.
WITHDRAWN: The proof contains an uncorrectable gap in the proof of theorem 7 on page 11. A proof of the Krzyz conjecture is presented, based on the application of the variational method, as well as on the use of two classical results and…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…
We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…
We study a class of Riemann-Hilbert problems arising naturally in Donaldson-Thomas theory. In certain special cases we show that these problems have unique solutions which can be written explicitly as products of gamma functions. We briefly…
This analysis which uses new mathematical methods aims at proving the Riemann hypothesis and figuring out an approximate base for imaginary non-trivial zeros of zeta function at very large numbers, in order to determine the path that those…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…