Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Gloria
Contact Gloria, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck RackActions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Articles
A lower bound for the complex flow number of a graph: A geometric approach
Let r ≥ 2 $r\ge 2$ be a real number. A complex nowhere-zero r $r$ -flow on a graph G $G$ is an orientation of G $G$ together with an assignment φ : E ( G ) → C $\varphi :E(G)\to {\mathbb{C}}$ such that, for all e ∈ E ( G ) $e\in E(G)$ , the Euclidean norm of the complex number φ ( e ) $\varphi (e)$ lies in the interval [ 1 , r − 1 ] $[1,r-1]$ and, for every vertex, the incoming flow is equal to the outgoing flow.
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Gloria
Contact Gloria, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack