3 papers
math.CO2024
Positive co-degree thresholds for spanning structures
Anastasia Halfpap, Van Magnan
The \textit{minimum positive co-degree} of a non-empty -graph , denoted , is the largest integer such that if a set of size is contai…
math.CO2024
Generalized Ramsey-Turán Numbers
József Balogh, Van Magnan, Cory Palmer
The Ramsey-Turán problem for asks for the maximum number of edges in an -vertex -free graph with independence number . 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 is said to contain another zero-one matrix if we can delete some rows and columns of and replace some -entries with -entries such that the resul…