GMGrace McCourt

Grace McCourt

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Grace McCourt has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A topological product Tverberg theorem

    by Andreas Holmsen, Grace McCourt, Daniel McGinnis, Shira Zerbib

    We prove a generalization of the topological Tverberg theorem. One special instance of our general theorem is the following: Let Δ \Delta denote the 8-dimensional simplex viewed as an abstract simplicial complex, and suppose that its vertices are arranged in a 3 × 3 3\times 3 array. Then for any continuous map f : Δ → R 3 f:\Delta \to \mathbb {R}^3 it is possible to partition the rows or the columns of the vertex array into two parts, such that the disjoint faces σ \sigma and τ \tau induced by the two parts satisfy f ( σ ) ∩ f ( τ ) ≠ ∅ f(\sigma )\cap f(\tau ) \neq \emptyset . Our result also has consequences for geometric transversals and topological Helly theorems.

  • Open Access

    A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs, II: Large Uniformities

    by Alexandr Kostochka, Ruth Luo, Grace McCourt

    Dirac proved that each $n$-vertex $2$-connected graph with minimum degree $k$ contains a cycle of length at least $\min\{2k, n\}$. We obtain analogous results for Berge cycles in hypergraphs. Recently, the authors proved an exact lower bound on the minimum degree ensuring a Berge cycle of length at least $\min\{2k, n\}$ in $n$-vertex $r$-uniform $2$-connected hypergraphs when $k \geq r+2$. In this paper we address the case $k \leq r+1$ in which the bounds have a different behavior. We prove that each $n$-vertex $r$-uniform $2$-connected hypergraph $H$ with minimum degree $k$ contains a Berge cycle of length at least $\min\{2k,n,|E(H)|\}$. If $|E(H)|\geq n$, this bound coincides with the bound of the Dirac's Theorem for 2-connected graphs.


  • Open Access

    Online Ramsey numbers of ordered graphs

    by Emily Heath, Dylan King, Grace McCourt, Hannah Sheats, Justin Wisby

    The online ordered Ramsey game is played between two players, Builder and Painter, on an infinite sequence of vertices with ordered graphs $(G_1,G_2)$, which have linear orderings on their vertices. On each turn, Builder first selects an edge before Painter colors it red or blue. Builder's objective is to construct either an ordered red copy of $G_1$ or an ordered blue copy of $G_2$, while Painter's objective is to delay this for as many turns as possible. The online ordered Ramsey number $r_o(G_1,G_2)$ is the number of turns Builder takes to win in the case that both players play optimally. Few lower bounds are known for this quantity. In this paper, we introduce a succinct proof of a new lower bound based on the maximum left- and right-degrees in the ordered graphs. We also upper bound $r_o(G_1,G_2)$ in two cases: when $G_1$ is a cycle and $G_2$ a complete bipartite graph, and when $G_1$ is a tree and $G_2$ a clique.