Repeated communication and Ramsey graphs
From MaRDI portal
Publication:4859754
DOI10.1109/18.412676zbMATH Open0831.94003OpenAlexW2052705277MaRDI QIDQ4859754FDOQ4859754
Authors: Noga Alon, Alon Orlitsky 
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
Recommendations
- Three results on interactive communication
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- On interactive communication
- Interactive Communication of Balanced Distributions and of Correlated Files
- Privileged users in zero-error transmission over a noisy channel
Applications of graph theory (05C90) Communication theory (94A05) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)
Cited In (22)
- Asymptotic values of the Hall-ratio for graph powers
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- On the number of zero-patterns of a sequence of polynomials
- New lower bounds for the Shannon capacity of odd cycles
- Quadratic forms on graphs
- Random Latin square graphs
- On colorful edge triples in edge-colored complete graphs
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- Grothendieck-type inequalities in combinatorial optimization
- List Ramsey numbers
- Colouring strong products
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Shannon capacity and the categorical product
- On a diagonal conjecture for classical Ramsey numbers
- Random cyclic triangle-free graphs of prime order
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Difference sets and positive exponential sums. I: General properties
- The chromatic number of random Cayley graphs
- Large sets in finite fields are sumsets
- Lovász, vectors, graphs and codes
- On the normalized Shannon capacity of a union
- Probabilistic refinement of the asymptotic spectrum of graphs
This page was built for publication: Repeated communication and Ramsey graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859754)
