Sensitivity and Hamming graphs

DOI10.1002/JGT.70034MaRDI QIDQ7262423zbMATH OpenFDO

Authors Sara Asensio, Yuval Filmus, Ignacio García Marco, Kolja Knauer

Publication date 11 June 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.70034

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• An induced subgraph of the Hamming graph with maximum degree 1
• Complexity measures on the symmetric group and beyond (extended abstract)
• Counterexamples to ``A conjecture on induced subgraphs of Cayley graphs
• Coverings by rook domains
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Induced subgraphs of powers of oriented cycles
• Induced subgraphs of product graphs and a generalization of Huang's theorem
• On induced subgraph of Cartesian product of paths
• On induced subgraphs of the cube
• On sensitivity in bipartite Cayley graphs
• On the degree of Boolean functions as real polynomials
• On the maximum degree of induced subgraphs of the Kneser graph
• The equivalence of two problems on the cube
• Unitary signings and induced subgraphs of Cayley graphs of \(\mathbb{Z}_2^n\)

This page was built for publication: Sensitivity and Hamming graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262423)