scientific article; zbMATH DE number 7378654
From MaRDI portal
Publication:5009538
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.42zbMath1498.05165MaRDI QIDQ5009538
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Measures of information, entropy (94A17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles of nonzero elements in low rank matrices
- A note on Ramsey numbers
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Asymptotic lower bounds for Ramsey functions
- Explicit Ramsey graphs and orthonormal labelings
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Constructive lower bounds on classical multicolor Ramsey numbers
- Some structural properties of low-rank matrices related to computational complexity
- Information flows, graphs and their guessing numbers
- Ramsey bounds for graph products
- Orthogonal representations over finite fields and the chromatic number of graphs
- H-wise independence
- On cycle—Complete graph ramsey numbers
- On the Shannon capacity of a graph
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- The Minrank of Random Graphs
- On Minrank and Forbidden Subgraphs
- Index Coding With Side Information
- Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
- Linear Index Coding via Semidefinite Programming
- MaxCut in ${\bm H)$-Free Graphs
- A note on odd cycle-complete graph Ramsey numbers
This page was built for publication:
