V. Pepe

collaborators

5 papers

math.CO2019

A construction for clique-free pseudorandom graphs

Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe

A construction of Alon and Krivelevich gives highly pseudorandom $K_{k}$ -free graphs on $n$ vertices with edge density equal to $Θ (n^{- 1/ (k - 2)})$ . In this short note we improve thei…

math.CO2019

On varieties defined by large sets of quadrics and their application to error-correcting codes

Simeon Ball, Valentina Pepe

Let $U$ be a $((2 k - 1) - 1)$ -dimensional subspace of quadratic forms defined on $PG (k - 1, F)$ with the property that $U$ does not contain any reducible quad…

math.CO2018

Non-intersecting Ryser hypergraphs

Anurag Bishnoi, Valentina Pepe

A famous conjecture of Ryser states that every $r$ -partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this c…

math.CO2015

A non-existence result on symplectic semifield spreads

Stefano Capparelli, Valentina Pepe

We prove that there do not exist non-Desarguesian symplectic semifield spreads of PG $(5, q^{2})$ , $q \geq 2^{14}$ even, whose associated semifield has center containing $F_{q}$ ,…

math.CO2015

Forbidden subgraphs in the norm graph

Simeon Ball, Valentina Pepe

We show that the norm graph constructed in [J. Kollár, L. Rónyai and T. Szabó, Norm-graphs and bipartite Turán numbers, Combinatorica, 16 (1996) 399--406] with $n$ vertices about $…