Constructive lower bounds for off-diagonal Ramsey numbers

DOI10.1007/BF02809902zbMath0988.05091MaRDI QIDQ5935811

Noga Alon, Pavel Pudlák

Publication date: 24 June 2002

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numberclique graphnorm graphs

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (9)

The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs ⋮ Some recent results on Ramsey-type numbers ⋮ Ramsey properties of semilinear graphs ⋮ Unimodular graphs and Eisenstein sums ⋮ Some constructive bounds on Ramsey numbers ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ On the spectrum of projective norm-graphs ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS ⋮ Hasse diagrams with large chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection theorems with geometric consequences
• Equations over finite fields. An elementary approach
• The Shannon capacity of a union
• Norm-graphs: Variations and applications
• Explicit Ramsey graphs and orthonormal labelings
• Constructive bounds for a Ramsey-type problem
• Some structural properties of low-rank matrices related to computational complexity
• Norm-graphs and bipartite Turán numbers
• Intersection Theorems for Systems of Sets
• On the Shannon capacity of a graph
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz

This page was built for publication: Constructive lower bounds for off-diagonal Ramsey numbers