V. Larsen

activity

20122021

most citedLinear preservers and representations with a 1-dimensional ring of invariants

18 citations · 23 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2021

Structure in sparse $k$ -critical graphs

Ron Gould, Victor Larsen, Luke Postle

Recently, Kostochka and Yancey proved that a conjecture of Ore is asymptotically true by showing that every $k$ -critical graph satisfies $|E(G)|\geq\left\lceil\left(\frac{k}{2}-\fr…

math.CO2017★ 3 cited

Forbidden Subgraphs for Chorded Pancyclicity

Megan Cream, Ronald J. Gould, Victor Larsen

We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$ , for $3 \leq m \leq ∣ V (G) ∣$ . In this paper, we define a new property called chorded pancycl…

math.CO2015★ 1 cited

List-antimagic labeling of vertex-weighted graphs

Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam +2

A graph $G$ is $k$ - $w e i g h t e d - l i s t - an t ima g i c$ if for any vertex weighting $ω : V (G) \to R$ and any list assignment $L : E (G) \to 2^{R}$ with $|L(e)|\geq |E(G)|…

math.CO2015★ 1 cited

Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c : E (G) \to [k]$ be an edge-coloring of a graph $G$ , not necessarily proper. For each vertex $v$ , let $c ˉ (v) = (a_{1}, \dots, a_{k})$ , where $a_{i}$ is the number of edges incident…

math.CO2014

The game chromatic number of trees and forests

Charles Dunn, Victor Larsen, Kira Lindke +2

While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary a…

math.RT2012★ 18 cited

Linear preservers and representations with a 1-dimensional ring of invariants

H. Bermudez, S. Garibaldi, V. Larsen

We determine the group of linear transformations on a vector space $V$ that preserve a polynomial function $f$ on $V$ for several interesting pairs $(V, f)$ , using the theory of sem…