Van Magnan

activity

20232026

collaborators

5 papers

math.CO2026

$1$ -cross intersecting set pair systems are small

Dylan King, Van Magnan, Cory Palmer

A set pair system ${(A_{i}, B_{i})}_{i = 1}^{m}$ is $1$ -cross intersecting if $∣ A_{i} \cap B_{i} ∣ = 0$ for all $i$ and $∣ A_{i} \cap B_{j} ∣ = 1$ whenever $i \neq = j$ . Let $m (a, b, 1)$ denote the maximu…

math.CO2024

Positive co-degree thresholds for spanning structures

Anastasia Halfpap, Van Magnan

The \textit{minimum positive co-degree} of a non-empty $r$ -graph $H$ , denoted $δ_{r - 1}^{+} (H)$ , is the largest integer $k$ such that if a set $S \subset V (H)$ of size $r - 1$ is contai…

math.CO2024

Generalized Ramsey-Turán Numbers

József Balogh, Van Magnan, Cory Palmer

The Ramsey-Turán problem for $K_{p}$ asks for the maximum number of edges in an $n$ -vertex $K_{p}$ -free graph with independence number $o (n)$ . In a natural generalization of the proble…

math.CO2024

Tight general bounds for the extremal numbers of 0-1 matrices

Barnabás Janzer, Oliver Janzer, Van Magnan +1

A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some $1$ -entries with $0$ -entries such that the resul…

math.CO2023

A generalization of diversity for intersecting families

Van Magnan, Cory Palmer, Ryan Wood

Let $F \subseteq (r [ n ])$ be an intersecting family of sets and let $Δ (F)$ be the maximum degree in $F$ , i.e., the maximum number of edges of $\…

1-cross intersecting set pair systems are small

Positive co-degree thresholds for spanning structures

Generalized Ramsey-Turán Numbers

Tight general bounds for the extremal numbers of 0-1 matrices

A generalization of diversity for intersecting families

$1$ -cross intersecting set pair systems are small