Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-16T15:25:39.511Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Explicit Ramsey Graphs and Modular Sieves

Published online by Cambridge University Press:  03 December 2003

Vince Grolmusz
Vince Grolmusz*
Affiliation:
Department of Computer Science, Eötvös University, Pázmány Péter Sétány 1/C, H-1117 Budapest, Hungary
*
(e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

In a previous paper we found a relation between the ranks of co-diagonal matrices (matrices with zeroes in their diagonal and nonzeroes elsewhere) and the quality of explicit Ramsey graph constructions. We also gave a construction based on the BBR polynomial of Barrington, Beigel and Rudich. In the present work we give another construction for low-rank co-diagonal matrices, based on a modular sieve formula.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 5-6: This issue contains volume twelve, parts five and six , November 2003 , pp. 565 - 569
Copyright
Copyright © Cambridge University Press 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)