Related papers: Strongly sublinear separators and polynomial expan…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
We show that there is an infinite set of primes $\mathcal{P}$ of density one, such that the family of \textit{all} Cayley graphs of $\mathrm{SL}(2,p)$%, $p\in \mathcal{P}$, is a family of expanders.
Given a finite set of $2$-edge-coloured graphs $\mathcal F$ and a hereditary property of graphs $\mathcal{P}$, we say that $\mathcal F$ expresses $\mathcal{P}$ if a graph $G$ has the property $\mathcal{P}$ if and only if it admits a…
A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicative. In an attempt to explore the boundaries of current…
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path $P_4$ as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite…
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable…
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
Let $P$ be a monic polynomial of degree $n$ with roots $x_1,\ldots,x_n$. We study the discriminants of the derivatives $P^{(k)}$ as symmetric translation-invariant polynomials in the original roots. The general ``square-graph cone''…
In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…
The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…
In this thesis we prove Schur-positivity of certain graph families. In addition, we exlpor existence of cyclic descent extensions on several families of Schur-positive sets.
We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols.…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
In this notice, we revisit the recent work [1] of Jung Yoog Kang and Tai Sup about special polynomials with exponential distribution in order to state some improvements and get new proofs for results therein.
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric (genus and gonality) growth. Combining this general result with finiteness…