Repeated communication and Ramsey graphs
From MaRDI portal
Publication:4859754
DOI10.1109/18.412676zbMath0831.94003OpenAlexW2052705277MaRDI QIDQ4859754
Publication date: 12 February 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/59cef85b83ac47185d1467f8c4264fc321867e87
Applications of graph theory (05C90) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Source coding (94A29)
Related Items
New lower bounds for the Shannon capacity of odd cycles ⋮ Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ Random Latin square graphs ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ Shannon capacity and the categorical product ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Random cyclic triangle-free graphs of prime order ⋮ Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ List Ramsey numbers ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ On the Normalized Shannon Capacity of a Union ⋮ The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős ⋮ On the number of zero-patterns of a sequence of polynomials ⋮ Lovász, Vectors, Graphs and Codes ⋮ Difference sets and positive exponential sums. I: General properties ⋮ Quadratic forms on graphs ⋮ Large sets in finite fields are sumsets ⋮ The chromatic number of random Cayley graphs ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ On a diagonal conjecture for classical Ramsey numbers
