Related papers: Une conjecture de Kontsevich et Shoikhet et la car…
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…
We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…
A long-standing conjecture of Erd\H{o}s and Simonovits asserts that for every rational number $r\in (1,2)$ there exists a bipartite graph $H$ such that $\ex(n,H)=\Theta(n^r)$. So far this conjecture is known to be true only for rationals of…
We prove a conjecture of Fomichev and Karev [{European J. Combin.} 127 (2025) 104160] by showing the equality of two graph invariants: $\varphi$, defined via graph colorings, and $\psi$, derived from the $\mathfrak{sl}(2)$-weight system of…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…
We give characterizations of the structure and degree sequences of hereditary unigraphs, those graphs for which every induced subgraph is the unique realization of its degree sequence. The class of hereditary unigraphs properly contains the…
We prove a distribution-theoretic conjecture of Robert Coleman, thereby also obtaining an explicit description of the complete set of Euler systems for the multiplicative group over Q.
We present a generalization of Brouwer's conjectural family of inequalities -- a popular family of inequalities in spectral graph theory bounding the partial sum of the Laplacian eigenvalues of graphs -- for the case of abstract simplicial…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
We consider generalizations of Szpiro's classical discriminant conjecture to hyperelliptic curves over a number field $K$, and to smooth, projective and geometrically connected curves $X$ over $K$ of genus at least one. The main results…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
Dorpalen-Barry et al. proved Elser's conjecture about sign of Elser's number by interpreting them as certain sums of reduced Euler characteristics of an abstract simplicial complex known as $U$-nucleus complex. We prove a conjecture posed…
We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…
In this note we will present how Euler's investigations on various different subjects lead to certain properties of the Legendre polynomials. More precisely, we will show that the generating function and the difference equation for the…
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…
The notion of a tropical vector bundle on a toric variety was recently introduced by Khan-Maclagan and Kaveh-Manon. In this paper, we study the Euler characteristic and rank of global sections for tropical vector bundles. We associate a…