Gweneth McKinley

activity

20172024

most citedResilience of the Rank of Random Matrices

4 citations · 7 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2024★ 2 cited

Small Ramsey numbers for books, wheels, and generalizations

Bernard Lidický, Gwen McKinley, Florian Pfender +1

In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing $R (W_{5}, W_{7}) = 15$ , matching upper and l…

math.CO2023

The Random Turán Problem for Theta Graphs

Gwen McKinley, Sam Spiro

Given a graph $F$ , we define $ex (G_{n, p}, F)$ to be the maximum number of edges in an $F$ -free subgraph of the random graph $G_{n, p}$ . Very little is known about $\op…

math.CO2023

The number of colorings of the middle layers of the Hamming cube

Lina Li, Gweneth McKinley, Jinyoung Park

For an odd integer $n = 2 d - 1$ , let $B_{d}$ be the subgraph of the hypercube $Q_{n}$ induced by the two largest layers. In this paper, we describe the typical structure of prop…

math.CO2022★ 1 cited

On the zeroes of hypergraph independence polynomials

David Galvin, Gwen McKinley, Will Perkins +2

We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical phys…

math.CO2020

Maximum entropy and integer partitions

Gweneth McKinley, Marcus Michelen, Will Perkins

We derive asymptotic formulas for the number of integer partitions with given sums of $j$ th powers of the parts for $j$ belonging to a finite, non-empty set $J \subset N$ .…

math.CO2019★ 4 cited

Resilience of the Rank of Random Matrices

Asaf Ferber, Kyle Luh, Gweneth McKinley

Let $M$ be an $n \times m$ matrix of independent Rademacher ( $\pm 1$ ) random variables. It is well known that if $n \leq m$ , then $M$ is of full rank with high probability. We show…

math.CO2019

Super-logarithmic cliques in dense inhomogeneous random graphs

Gweneth McKinley

In the theory of dense graph limits, a graphon is a symmetric measurable function $W : [0, 1]^{2} \to [0, 1]$ . Each graphon gives rise naturally to a random graph distribution, denoted $\…

math.CO2017

Supersaturated sparse graphs and hypergraphs

Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij

A central problem in extremal graph theory is to estimate, for a given graph $H$ , the number of $H$ -free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartit…