O. Khormali

activity

20162023

most citedA fast topological approach for predicting anomalies in time-varying graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2020

Turán numbers for hypergraph star forests

Omid Khormali, Cory Palmer

Fix a graph $F$ . We say that a graph is {\it $F$ -free} if it does not contain $F$ as a subgraph. The {\it Turán number} of $F$ , denoted $ex (n, F)$ , is the maximum number of…

math.CO2016

Regular colorings and factors of regular graphs

Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4

An $(r - 1, 1)$ -coloring of an $r$ -regular graph $G$ is an edge coloring such that each vertex is incident to $r - 1$ edges of one color and $1$ edge of a different color. In this paper…