Independent set and matching permutations

DOI10.1002/jgt.22724zbMath1522.05351arXiv1901.06579OpenAlexW3184553714MaRDI QIDQ6056793

David Galvin, Taylor Ball, Unnamed Author, Unnamed Author

Publication date: 4 October 2023

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

Full work available at URL: https://arxiv.org/abs/1901.06579

zbMATH Keywords

matchingstable setpermutationindependent setunimodality

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the independent set sequence of a tree

Cites Work

• Unnamed Item
• Unnamed Item
• A bipartite graph with non-unimodal independent set sequence
• Maximal-clique partitions and the roller coaster conjecture
• Rook placements in Young diagrams and permutation enumeration
• Face vectors of flag complexes
• An asymptotic equivalent for the number of total preorders on a finite set
• Bounds on the number of complete subgraphs
• On unimodal sequences of graphical invariants
• Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
• Roots of independence polynomials of well covered graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• Theory of monomer-dimer systems
• Shadows of colored complexes.
• Pascal's Matrices
• The independent set sequence of some families of trees

This page was built for publication: Independent set and matching permutations