On the Spectrum of Wenger Graphs

Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite sets $P$ and $L$ defined as follows: a point $(p)=(p_1,p_2,\ldots,p_{m+1})\in P$ is adjacent to a line $[l]=[l_1,l_2,\ldots,l_{m+1}]\in L$ if and only if the following $m$ equalities hold: $l_{i+1} + p_{i+1}=l_{i}p_1$ for $i=1,\ldots, m$. We call the graphs $W_m(q)$ Wenger graphs. In this paper, we determine all distinct eigenvalues of the adjacency matrix of $W_m(q)$ and their multiplicities. We also survey results on Wenger graphs.Comment: 9 pages; accepted for publication to J. Combin. Theory, Series

Tur\'an numbers for Ks,tK_{s,t}-free graphs: topological obstructions and algebraic constructions

We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be generalized to a similar construction of $K_{s,s}$-free graphs for any $s\geq 4$. We also give new constructions of extremal $K_{s,t}$-free graphs for large $t$.Comment: Fixed a small mistake in the application of Proposition

Graphs with few paths of prescribed length between any two vertices

We use a variant of Bukh's random algebraic method to show that for every natural number $k \geq 2$ there exists a natural number $\ell$ such that, for every $n$, there is a graph with $n$ vertices and $\Omega_k(n^{1 + 1/k})$ edges with at most $\ell$ paths of length $k$ between any two vertices. A result of Faudree and Simonovits shows that the bound on the number of edges is tight up to the implied constant.Comment: 8 page

A bound on the number of edges in graphs without an even cycle

We show that, for each fixed $k$, an $n$-vertex graph not containing a cycle of length $2k$ has at most $80\sqrt{k}\log k\cdot n^{1+1/k}+O(n)$ edges.Comment: 16 pages, v2 appeared in Comb. Probab. Comp., v3 fixes an error in v2 and explains why the method in the paper cannot improve the power of k further, v4 fixes the proof of Theorem 12 introduced in v