15 citations · 54 across the 30 of their papers we have counts for
6 papers · 1 filter
Bell coloring graphs: realizability and reconstruction
Shamil Asgarli, Sara Krehbiel, Simon MacLean
Given a graph , the Bell -coloring graph has vertices given by partitions of into independent sets (allowing empty parts), with two partitions a…
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…
Blocking sets from a union of plane curves
Shamil Asgarli, Dragos Ghioca, Chi Hoi Yip
Motivated by a question of Erdős on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construc…
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 polyno…
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}…
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+…