14 papers
Coloring graphs as complete graph invariants
Shamil Asgarli, Sara Krehbiel, Howard W. Levinson
We investigate the extent to which the -coloring graph uniquely determines the base graph and the number of colors . The vertices of $\mathcal{C}_{k}…
Defective chromatic polynomials
Shamil Asgarli, Tamsen Whitehead McGinley, Nicholas Xue
For a graph and an integer , the defective chromatic polynomial counts the -colorings of in which each vertex has at most neighbors of its own c…
Improved lower bounds for the maximum order of an induced acyclic subgraph
Shamil Asgarli, Donald Falkenhagen, Kaya Hoshi
Computing the cardinality of a maximum induced acyclic vertex set in a digraph is NP-hard. Since finding an exact solution is computationally difficult, a fruitful approach is to e…
An ErdÅs-Ko-Rado theorem for binary codes
Shamil Asgarli, Chi Hoi Yip
We study intersecting families of words from the ErdÅs-Ko-Rado perspective. When the alphabet size is , a maximum intersecting family is not necessarily a star. However, we pro…
Hypersurfaces passing through the Galois orbit of a point
Shamil Asgarli, Jonathan Love, Chi Hoi Yip
Asgarli, Ghioca, and Reichstein proved that if is a field with , then for any positive integers and , and separable field extension with degree $m=\binom{n+…
Collision of orbits for families of polynomials defined over fields of positive characteristic
Shamil Asgarli, Dragos Ghioca
Let be a field of positive characteristic with a fixed algebraic closure , and let . For an integer , we consider the family of pol…