Lovász, Vectors, Graphs and Codes

DOI10.1007/978-3-662-59204-5_1zbMath1443.05088OpenAlexW3005501584MaRDI QIDQ3295262

Noga Alon

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-59204-5_1

zbMATH Keywords

Cayley graphsRamsey graphsShannon capacity of graphs\(\theta\)-functionmaxcutlist decodable codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

The minrank of random graphs over arbitrary fields, An improved lower bound on multicolor Ramsey numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• A note on the independence number of triangle-free graphs
• On systems of vectors in a Hilbert space
• Explicit construction of linear sized tolerant networks
• A note on Ramsey numbers
• Systems of vectors in Euclidean space and an extremal problem for polynomials
• Intersection theorems with geometric consequences
• A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
• The Shannon capacity of a union
• Explicit Ramsey graphs and orthonormal labelings
• Constructive bounds for a Ramsey-type problem
• Approximating the independence number via the \(\vartheta\)-function
• Maximum cuts and judicious partitions in graphs without short cycles
• Tough Ramsey graphs without short cycles
• Some structural properties of low-rank matrices related to computational complexity
• Ramsey bounds for graph products
• Bipartite subgraphs
• Graph Theory and Probability. II
• Forbidden Intersections
• A note on bipartite subgraphs of triangle‐free graphs
• On the Shannon capacity of a graph
• Randomized graph products, chromatic numbers, and Lovasz j-function
• Bipartite Subgraphs of Triangle-Free Graphs
• List-Decodable Zero-Rate Codes
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Repeated communication and Ramsey graphs
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• A Sequence of Triangle-Free Pseudorandom Graphs
• Dynamic concentration of the triangle-free process
• On the construction of certain graphs
• Some Extremal Properties of Bipartite Subgraphs
• MaxCut in ${\bm H)$-Free Graphs