3.6k citations
- Rutherford Appleton LaboratoryGB80 papers
- Centre National de la Recherche ScientifiqueFR73 papers
- Imperial College LondonGB73 papers
- California Institute of TechnologyUS60 papers
- Lomonosov Moscow State UniversityRU59 papers
- The Ohio State UniversityUS58 papers
- European Organization for Nuclear ResearchCH57 papers
- Massachusetts Institute of TechnologyUS56 papers
- University of ZurichCH54 papers
- University of California, DavisUS53 papers
- University of RochesterUS51 papers
- Cornell UniversityUS50 papers
Showing 2003 · math.COShow all
3 papers · 2 filters
math.CO2003★ 113 cited
A Szemeredi-type regularity lemma in abelian groups, with applications
Ben Green
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemm…
math.CO2003
On the structure of the adjacency matrix of the line digraph of a regular digraph
Simone Severini
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M=AB, where the matrix A is the Kronecker product of the all-ones m…
math.CO2003★ 3 cited
Sum-free sets in abelian groups
Ben Green, Imre Z. Ruzsa
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the larges…