Related papers: Une conjecture de Kontsevich et Shoikhet et la car…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
Characterizing graphs by their spectra is a fundamental and challenging problem in spectral graph theory, which has received considerable attention in recent years. A major unsolved conjecture in this area is Haemers' conjecture which…
In this paper, we prove Lusztig's conjecture for finite special linear groups, i.e., we show that characteristic functions of character sheaves coincide with almost characters up to scalar constants, under the condition that the…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
Let \mathcal{F}_k denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollob\'as conjectured that for every \epsilon>0 and positive…
We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…
An \emph{$(n,k,t)$-graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Tur\'an's Theorem, rephrased in terms of graph complements, states that the unique minimum $(n,k,2)$-graph is an…
Given a pair of modular forms with complex multiplication by distinct imaginary quadratic fields, the four dimensional Galois representation associated to their Rankin--Selberg convolution is induced from a character over an imaginary…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
We refine a Le and Murakami uniqueness theorem for the Kontsevich Integral in order to specify the relationship between the two (possibly equal) main universal link invariants: the Kontsevich Integral and the perturbative expression of the…
Kollar and Ruan proved symplectic deformation invariance for uniruledness of Kaehler manifolds. Zhiyu Tian proved the same for rational connectedness in dimension < 4. Kollar conjectured this in all dimensions. We prove Kollar's conjecture,…
We formulate two conjectures about etale cohomology and fundamental groups motivated by categoricity conjectures in model theory. One conjecture says that there is a unique Z-form of the etale cohomology of complex algebraic varieties, up…
For a graph $G$, $\chi(G)$ denotes the chromatic number of $G$ and $\omega(G)$ denotes the size of the largest clique in $G$. A hereditary class of graphs is called $\chi$-bounded if there is a function $f$ such that for each graph $G$ in…
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
Boij-S\"oderberg theory concerns resolutions of graded modules over a polynomial ring over a field. Specifically Boij-S\"oderberg theory gives a description of the cone of Betti diagrams for Cohen-Macaulay modules. Eisenbud and Schreyer…
Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…
In this article we study a conjecture of Geiss-Leclerc-Schr{\"o}er, which is an analogue of a classical conjecture of Lusztig in the Weyl group case. It concerns the relation between canonical basis and semi-canonical basis through the…
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…
Csikv\'{a}ri constructed a poset on trees to prove that several graph functions attain extreme values at the star and the path among the trees on a fixed number of vertices. Reiner and Smith proved that the Tutte polynomials $T(1,y)$ of…