Graph powers, Delsarte, Hoffman, Ramsey, and Shannon

Noga Alon, Eyal Lubetzky

Research output: Contribution to journalArticle

Abstract

The kth p-power of a graph G is the graph on the vertex set V(G) k, where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is polylogarithmic in the number of vertices; thus graphs with small independence numbers in their p-powers do not contain large homogeneous subsets. We provide algebraic upper bounds for the asymptotic behavior of independence numbers of such powers, settling a conjecture of [N. Alon and E. Lubetzky, Combinatorica, 27 (2007), pp. 13-33] up to a factor of 2. For precise bounds on some graphs, we apply Delsarte's linear programming bound and Hoffman's eigenvalue bound. Finally, we show that for any nontrivial graph G, one can point out specific induced subgraphs of large p-powers of G with neither a large clique nor a large independent set. We prove that the larger the Shannon capacity of Ḡ is, the larger these subgraphs are, and if G is the complete graph, then some p-power of G matches the bounds of the Frankl-Wilson Ramsey construction, and is in fact a subgraph of a variant of that construction.

Original languageEnglish (US)
Pages (from-to)329-348
Number of pages20
JournalSIAM Journal on Discrete Mathematics
Volume21
Issue number2
DOIs
StatePublished - 2007

Fingerprint

Graph Powers
Graph in graph theory
Independence number
Linear programming
Subgraph
Adjacent
Eigenvalue Bounds
Clique number
Congruent
Induced Subgraph
Independent Set
Clique
Complete Graph
Large Set
Modulo
Asymptotic Behavior
Upper bound
Subset
Vertex of a graph

Keywords

  • Cliques and independent sets
  • Delsarte's linear programming bound
  • Eigenvalue bounds
  • Graph powers
  • Ramsey theory

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Graph powers, Delsarte, Hoffman, Ramsey, and Shannon. / Alon, Noga; Lubetzky, Eyal.

In: SIAM Journal on Discrete Mathematics, Vol. 21, No. 2, 2007, p. 329-348.

Research output: Contribution to journalArticle

@article{7f8d98d2808542588d337d98ff290c61,
title = "Graph powers, Delsarte, Hoffman, Ramsey, and Shannon",
abstract = "The kth p-power of a graph G is the graph on the vertex set V(G) k, where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is polylogarithmic in the number of vertices; thus graphs with small independence numbers in their p-powers do not contain large homogeneous subsets. We provide algebraic upper bounds for the asymptotic behavior of independence numbers of such powers, settling a conjecture of [N. Alon and E. Lubetzky, Combinatorica, 27 (2007), pp. 13-33] up to a factor of 2. For precise bounds on some graphs, we apply Delsarte's linear programming bound and Hoffman's eigenvalue bound. Finally, we show that for any nontrivial graph G, one can point out specific induced subgraphs of large p-powers of G with neither a large clique nor a large independent set. We prove that the larger the Shannon capacity of Ḡ is, the larger these subgraphs are, and if G is the complete graph, then some p-power of G matches the bounds of the Frankl-Wilson Ramsey construction, and is in fact a subgraph of a variant of that construction.",
keywords = "Cliques and independent sets, Delsarte's linear programming bound, Eigenvalue bounds, Graph powers, Ramsey theory",
author = "Noga Alon and Eyal Lubetzky",
year = "2007",
doi = "10.1137/060657893",
language = "English (US)",
volume = "21",
pages = "329--348",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - Graph powers, Delsarte, Hoffman, Ramsey, and Shannon

AU - Alon, Noga

AU - Lubetzky, Eyal

PY - 2007

Y1 - 2007

N2 - The kth p-power of a graph G is the graph on the vertex set V(G) k, where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is polylogarithmic in the number of vertices; thus graphs with small independence numbers in their p-powers do not contain large homogeneous subsets. We provide algebraic upper bounds for the asymptotic behavior of independence numbers of such powers, settling a conjecture of [N. Alon and E. Lubetzky, Combinatorica, 27 (2007), pp. 13-33] up to a factor of 2. For precise bounds on some graphs, we apply Delsarte's linear programming bound and Hoffman's eigenvalue bound. Finally, we show that for any nontrivial graph G, one can point out specific induced subgraphs of large p-powers of G with neither a large clique nor a large independent set. We prove that the larger the Shannon capacity of Ḡ is, the larger these subgraphs are, and if G is the complete graph, then some p-power of G matches the bounds of the Frankl-Wilson Ramsey construction, and is in fact a subgraph of a variant of that construction.

AB - The kth p-power of a graph G is the graph on the vertex set V(G) k, where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The clique number of powers of G is polylogarithmic in the number of vertices; thus graphs with small independence numbers in their p-powers do not contain large homogeneous subsets. We provide algebraic upper bounds for the asymptotic behavior of independence numbers of such powers, settling a conjecture of [N. Alon and E. Lubetzky, Combinatorica, 27 (2007), pp. 13-33] up to a factor of 2. For precise bounds on some graphs, we apply Delsarte's linear programming bound and Hoffman's eigenvalue bound. Finally, we show that for any nontrivial graph G, one can point out specific induced subgraphs of large p-powers of G with neither a large clique nor a large independent set. We prove that the larger the Shannon capacity of Ḡ is, the larger these subgraphs are, and if G is the complete graph, then some p-power of G matches the bounds of the Frankl-Wilson Ramsey construction, and is in fact a subgraph of a variant of that construction.

KW - Cliques and independent sets

KW - Delsarte's linear programming bound

KW - Eigenvalue bounds

KW - Graph powers

KW - Ramsey theory

UR - http://www.scopus.com/inward/record.url?scp=45249112834&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45249112834&partnerID=8YFLogxK

U2 - 10.1137/060657893

DO - 10.1137/060657893

M3 - Article

AN - SCOPUS:45249112834

VL - 21

SP - 329

EP - 348

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -