Michael C. Wigal

activity

20172025

most citedLarge cycles in essentially 4-connected graphs

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

collaborators

Showing 2024Show all

4 papers · 1 filter

math.CO2024

Longest Path and Cycle Transversals in Chordal Graphs

James A. Long, Kevin G. Milans, Michael C. Wigal

We show that if $G$ is a $n$ -vertex connected chordal graph, then it admits a longest path transversal of size $O (lo g^{2} n)$ . Under the stronger assumption of 2-connectivity, we sh…

math.CO2024

Clique covers and decompositions of cliques of graphs

József Balogh, Jialin He, Robert A. Krueger +2

In 1966, Erdős, Goodman, and Pósa showed that if $G$ is an $n$ -vertex graph, then at most $⌊ n^{2} /4 ⌋$ cliques of $G$ are needed to cover the edges of $G$ , and the bound…

math.CO2024

On the number of $P$ -free set systems for tree posets $P$

József Balogh, Ramon I. Garcia, Michael C. Wigal

We say a finite poset $P$ is a tree poset if its Hasse diagram is a tree. Let $k$ be the length of the largest chain contained in $P$ . We show that when $P$ is a fixed tree poset,…

math.CO2024

The Cordiality Game and the Game Cordiality Number

Elliot Krop, Aryan Mittal, Michael C. Wigal

The cordiality game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting \track{unlabeled} vertices of $G$ . Admirable labels the selected…

Longest Path and Cycle Transversals in Chordal Graphs

Clique covers and decompositions of cliques of graphs

On the number of P-free set systems for tree posets P

The Cordiality Game and the Game Cordiality Number

On the number of $P$ -free set systems for tree posets $P$