Cover Image

An upper bound on the number of relevant variables for Boolean functions on the Hamming graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Valyuzhenich, Alexandr
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On strong nodal domains for eigenfunctions of Hamming graphs
by: Valyuzhenich, Alexandr, et al.
Published: (2025)

On $P$-crucial square-free permutations
by: Valyuzhenich, Alexandr
Published: (2025)

Bicrucial $k$-power-free permutations
by: Akhmejanova, Margarita, et al.
Published: (2024)

On degree-$3$ and $(n-4)$-correlation-immune perfect colorings of $n$-cubes
by: Krotov, Denis S., et al.
Published: (2023)

Spectral upper bounds for the Grundy number of a graph
by: Assis, Thiago, et al.
Published: (2024)

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

On the number of relevant variables for discrete functions
by: Potapov, V. N.
Published: (2024)

On the quantum chromatic number of Hamming and generalized Hadamard graphs
by: Cao, Xiwang, et al.
Published: (2025)

A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
by: Katz, Jasmin, et al.
Published: (2025)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

A sharp upper bound for the number of connected sets in any grid graph
by: Ma, Hongxia, et al.
Published: (2025)

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)

On upper domatic number of graphs
by: Paul, Subhabrata, et al.
Published: (2024)

An improved upper bound for the domination number of a graph
by: Arumugam, Subramanian, et al.
Published: (2024)

Burning Hamming graphs
by: Tokushige, Norihide
Published: (2024)

Best possible upper bounds on the restrained domination number of cubic graphs
by: Brešar, Boštjan, et al.
Published: (2024)

Optimizing the CGMS upper bound on Ramsey numbers
by: Gupta, Parth, et al.
Published: (2024)

Bootstrap percolation on the Hamming graphs
by: Miralaei, Meysam, et al.
Published: (2024)

An exponential upper bound for induced Ramsey numbers
by: Aragão, Lucas, et al.
Published: (2025)

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
by: Steinke, Finn A., et al.
Published: (2026)

Strengthened upper bound on the third eigenvalue of graphs
by: Li, Sida
Published: (2025)

Sensitivity and Hamming graphs
by: Asensio, Sara, et al.
Published: (2025)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
by: Abiad, Aida, et al.
Published: (2023)

On an upper bound for central binomial coefficients and Catalan numbers
by: Pain, Jean-Christophe
Published: (2024)

Total mutual-visibility in Hamming graphs
by: Bujtás, Csilla, et al.
Published: (2023)

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)

A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
by: Heath, Emily, et al.
Published: (2026)

A linear upper bound on zero-sum Ramsey numbers of $d$-degenerate graphs in $\mathbb{Z}_p$
by: Shapiro, Andrey
Published: (2026)

Proof of a conjectured spectral upper bound on the chromatic number of a graph
by: Tang, Quanyu, et al.
Published: (2025)

An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
by: Troncoso, E. Acosta, et al.
Published: (2026)

Some results on Hamming graphs and an extended Hamming graphs
by: Zafari, Ali, et al.
Published: (2025)

Turán number of complete bipartite graphs with bounded matching number
by: Luo, Huan, et al.
Published: (2024)

Completely regular codes in graphs covered by a Hamming graph
by: Goryainov, Sergey, et al.
Published: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

An improved upper bound for the multicolour Ramsey number of odd cycles
by: Axenovich, Maria, et al.
Published: (2025)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

On the number of non-degenerate canalizing Boolean functions
by: Kadelka, Claus
Published: (2025)

Limited-visibility Cops and Robbers on Hamming graphs
by: Jones, John, et al.
Published: (2025)

On the weak $k$-metric dimension of Hamming graphs
by: Fernandez, Elena, et al.
Published: (2025)