EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Sensitivity and Hamming Graphs

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

Journal of Graph Theory · 2026-07 · 112 (3) · 296-305

DOI: 10.1002/jgt.70034 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 30.03.2026. Verfasst von Sara Asensio und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Iowa Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For any we show that the Hamming graph admits an imbalanced partition into sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong ‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer. On the other hand, we prove their weaker ‐ary Sensitivity Conjecture by showing that the sensitivity of any ‐ary function is bounded from below by a polynomial expression in its degree.

Förderung

  • Iowa Science Foundation

Zitieren

APA

Asensio, S., Filmus, Y., García‐Marco, I., & Knauer, K. (2026). Sensitivity and Hamming Graphs. Journal of Graph Theory, 112(3), 296-305. https://doi.org/10.1002/jgt.70034

Vancouver

Asensio S, Filmus Y, García‐Marco I, Knauer K. Sensitivity and Hamming Graphs. Journal of Graph Theory. 2026;112(3):296-305. doi:10.1002/jgt.70034

BibTeX
@article{Asensio2026,
  author = {Asensio, Sara and Filmus, Yuval and García‐Marco, Ignacio and Knauer, Kolja},
  title = {Sensitivity and Hamming Graphs},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {112},
  number = {3},
  pages = {296--305},
  doi = {10.1002/jgt.70034}
}
Kostenlos starten →