output
20032005
most citedQuantum Walk on a Line with Two Entangled Particles

150 citations

Showing math.COShow all

14 papers · 1 filter

math.CO2008

High degree graphs contain large-star factors

Noga Alon, Nicholas Wormald

We show that any finite simple graph with minimum degree contains a spanning star forest in which every connected component is of size at least . This sett…

math.CO2005

A simple recurrence for covers of the sphere with branch points of arbitrary ramification

I. P. Goulden, Luis G. Serrano

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring…

math.CO20052 cited

Eigenvalue bounds for independent sets

C. D. Godsil, M. W. Newman

We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence…

math.CO20051 cited

Colouring Lines in Projective Space

Ameera Chowdhury, Chris Godsil, Gordon Royle

Let be a vector space of dimension over a field of order . The -Kneser graph has the -dimensional subspaces of as its vertices, where two subspaces and

math.CO20051 cited

Symmetric Squares of Graphs

Koenraad Audenaert, Chris Godsil, Gordon Royle +1

We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also prov…

math.CO2005

An explicit form for Kerov's character polynomials

I. P. Goulden, A. Rattan

Kerov considered the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as a polynomial in free cumulants. Biane has proved that thi…