EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A note on “Largest independent sets of certain regular subgraphs of the derangement graph”

Yuval Filmus, Nathan Lindzey

Journal of Algebraic Combinatorics · 2024-05 · 59 (3) · 575-579

DOI: 10.1007/s10801-024-01304-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 23.02.2024. Verfasst von Yuval Filmus und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 8 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: HORIZON EUROPE European Innovation Council, Technion - Israel Institute of Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $$D_{n,k}$$ D n , k be the set of all permutations of the symmetric group $$S_n$$ S n that have no cycles of length i for all $$1 \le i \le k$$ 1 ≤ i ≤ k . In the paper mentioned above, Ku, Lau, and Wong prove that the set of all the largest independent sets of the Cayley graph $$\text {Cay}(S_n,D_{n,k})$$ Cay ( S n , D n , k ) is equal to the set of all the largest independent sets in the derangement graph $$\text {Cay}(S_n,D_{n,1})$$ Cay ( S n , D n , 1 ) , provided n is sufficiently large in terms of k . We give a simpler proof that holds for all n , k and also applies to the alternating group.

Förderung

  • HORIZON EUROPE European Innovation Council
  • Technion - Israel Institute of Technology

Zitieren

APA

Filmus, Y., & Lindzey, N. (2024). A note on “Largest independent sets of certain regular subgraphs of the derangement graph”. Journal of Algebraic Combinatorics, 59(3), 575-579. https://doi.org/10.1007/s10801-024-01304-3

Vancouver

Filmus Y, Lindzey N. A note on “Largest independent sets of certain regular subgraphs of the derangement graph”. Journal of Algebraic Combinatorics. 2024;59(3):575-579. doi:10.1007/s10801-024-01304-3

BibTeX
@article{Filmus2024,
  author = {Filmus, Yuval and Lindzey, Nathan},
  title = {A note on “Largest independent sets of certain regular subgraphs of the derangement graph”},
  journal = {Journal of Algebraic Combinatorics},
  year = {2024},
  volume = {59},
  number = {3},
  pages = {575--579},
  doi = {10.1007/s10801-024-01304-3}
}
Kostenlos starten →