Image de couverture de livre

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Sason, Igal
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Advances in the Shannon Capacity of Graphs
par: Lavi, Nitay, et autres
Publié: (2025)

Observations on Graph Invariants with the Lovász $\vartheta$-Function
par: Sason, Igal
Publié: (2023)

On H-Intersecting Graph Families and Counting of Homomorphisms
par: Sason, Igal
Publié: (2025)

Counting Graph Homomorphisms in Bipartite Settings
par: Sason, Igal
Publié: (2025)

The Lovász Local Lemma: Fundamentals, Applications, and Perspectives
par: Sason, Igal
Publié: (2026)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
par: Abbe, Emmanuel, et autres
Publié: (2024)

On the transitivity of Gilbert graphs and their complements
par: Krupnik, Noam, et autres
Publié: (2026)

On Strongly Regular Graphs and the Friendship Theorem
par: Sason, Igal
Publié: (2025)

On the Ratio of Shannon Numbers of Graphs
par: Alipour, Sharareh, et autres
Publié: (2023)

Improved upper bounds for wide-sense frameproof codes
par: Zhao, Yuhao, et autres
Publié: (2024)

An improved lower bound on the Shannon capacities of complements of odd cycles
par: Zhu, Daniel G.
Publié: (2024)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
par: Shen, Yuanting, et autres
Publié: (2024)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
par: Abiad, Aida, et autres
Publié: (2024)

Stiefel manifolds and upper bounds for spherical codes and packings
par: Zargar, Masoud
Publié: (2024)

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
par: Kiermaier, Michael, et autres
Publié: (2015)

On the stabilizer of the graph of linear functions over finite fields
par: Smaldore, Valentino, et autres
Publié: (2024)

The Shannon capacity of graph powers
par: Abiad, Aida, et autres
Publié: (2025)

On Spectral Graph Determination
par: Sason, Igal, et autres
Publié: (2024)

Eigenvalue bounds and alternating rank-metric codes
par: Abiad, Aida, et autres
Publié: (2024)

Codes with restricted overlaps: expandability, constructions, and bounds
par: Stanovnik, Lidija
Publié: (2024)

On the independence number of de Bruijn graphs
par: Majer, Pietro, et autres
Publié: (2026)

Edge inducibility via local directed graphs
par: Chao, Ting-Wei, et autres
Publié: (2025)

Generalized graph codes and thier minimum distances
par: Fujii, Naoki
Publié: (2025)

On the $(k,\ell)$-multiset anonymity measure for social graphs
par: Estrada-Moreno, Alejandro, et autres
Publié: (2025)

On a recent extension of a family of biprojective APN functions
par: Kölsch, Lukas
Publié: (2024)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
par: Abiad, Aida, et autres
Publié: (2026)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
par: Mütze, Torsten, et autres
Publié: (2024)

Triprojective almost perfect nonlinear permutations and functions
par: Göloğlu, Faruk, et autres
Publié: (2026)

Equivalences of biprojective almost perfect nonlinear functions
par: Göloğlu, Faruk, et autres
Publié: (2021)

Nonvanishing $k$-flats of Boolean and vectorial functions
par: Kaspers, Christian
Publié: (2026)

On the minimum Hamming distance between vectorial Boolean and affine functions
par: Nagy, Gabor P.
Publié: (2025)

Explicit determination of a class of permutation rational functions in any characteristic
par: Li, Yi, et autres
Publié: (2026)

Association schemes arising from non-weakly regular bent functions
par: Wei, Yadi, et autres
Publié: (2024)

Semidefinite lower bounds for covering codes
par: Gijswijt, Dion, et autres
Publié: (2025)

Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
par: Chi, Yunwen, et autres
Publié: (2024)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
par: Kuffner, Luis, et autres
Publié: (2024)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

An exposition of recent list-size bounds of FRS Codes
par: Garg, Abhibhav, et autres
Publié: (2025)

Bent functions and strongly regular graphs
par: Smaldore, Valentino
Publié: (2022)

The capacity of a finite field matrix channel
par: Blackburn, Simon R., et autres
Publié: (2022)