9 papers
Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application
Ohr Kadrawi, Vadim E. Levit
Let be a finite simple graph. The annihilation number is an efficiently computable upper bound on the independence number . We develop a sharp matching-number the…
Higher Commutativity in Finite Groups, Rigidity, Extremal bounds, and Heisenberg-Type Families
Vadim E Levit, Robert Shwartz
For a finite group and an integer let where $\Hom(\mathbb Z^r,G)$ is the set of pairwise commuting -tuples in .…
A Ridge-Saturation Characterization of -Critical Graphs
Do Trong Hoang, Vadim E. Levit, Eugen Mandrescu +1
We characterize the graphs which are simultaneously -critical and members of the class . The characterization is stated in three equivalent languages. In the graph…
Higher Commutativity in Finite Groups: Exact Asymptotics and Finite Spectrum
Vadim E. Levit, Robert Shwartz
For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding n…
Graphs with core(G) = nucleus(G)
Vadim E. Levit, Eugen Mandrescu, Kevin Pereyra
Let be a finite simple graph. An independent set of is critical if for every independent set o…
The family of all local maximum independent sets is an augmentoid
Vadim E. Levit, Eugen Mandrescu
It was proved in (Levit and Mandrescu, 2022) that both and are augmentoids, established partial augmentation phenomena for the family $Ψ(…