University of South Carolina

output

19922026

most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

68 papers · 1 filter

math.CO2024

Outerplanar graphs with positive Lin-Lu-Yau curvature

George Brooks, Fadekemi Osaye, Anna Schenfisch +2

In this paper, we show that all simple outerplanar graphs $G$ with minimum degree at least $2$ and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most $9$ …

math.CO2023★ 1 cited

Sizes of flat maximal antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

This is the second of two papers investigating for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_{n}$ (the power set of $[n]:=\{1…

math.CO2022★ 1 cited

A natural bijection for contiguous pattern avoidance in words

Julia Carrigan, Isaiah Hollars, Eric Rowland

Two words $p$ and $q$ are avoided by the same number of length- $n$ words, for all $n$ , precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theor…

math.CO2021★ 6 cited

The saturation spectrum for antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

Extending a classical theorem of Sperner, we characterize the integers $m$ such that there exists a maximal antichain of size $m$ in the Boolean lattice $B_{n}$ , that is, the power s…

math.CO2021★ 1 cited

The Edge-Distinguishing Chromatic Number of Petal Graphs, Chorded Cycles, and Spider Graphs

Grant Fickes, Wing Hong Tony Wong

The edge-distinguishing chromatic number (EDCN) of a graph $G$ is the minimum positive integer $k$ such that there exists a vertex coloring $c : V (G) \to {1, 2, \dots, k}$ whose induce…

math.CO2020

On the size of planar graphs with positive Lin-Lu-Yau Ricci curvature

Linyuan Lu, Zhiyu Wang

We show that if a planar graph $G$ with minimum degree at least $3$ has positive Lin-Lu-Yau Ricci curvature on every edge, then $Δ (G) \leq 17$ , which then implies that $G$ is finite…

math.CO2019★ 5 cited

Poset Ramsey Numbers for Boolean Lattices

Linyuan Lu, Joshua C. Thompson

A subposet $Q^{'}$ of a poset $Q$ is a \textit{copy of a poset} $P$ if there is a bijection $f$ between elements of $P$ and $Q^{'}$ such that $x \leq y$ in $P$ iff $f (x) \leq f (y)$ in $Q^{'}$ …

math.CO2019

Some remarks on the midrange crossing constant

É. Czabarka, I. Singgih, L. A. Székely +1

We verify an upper bound of Pach and Tóth [Combinatorica 17(1997), 427-439, Discrete and Computational Geometry 36(2006), 527-552] on the midrange crossing constant. Details of the…

math.CO2019★ 7 cited

Wiener Index and Remoteness in Triangulations and Quadrangulations

Éva Czabarka, Peter Dankelmann, Trevor Olsen +1

Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the ma…

math.CO2019

Universal Gröbner Bases of Toric Ideals of Combinatorial Neural Codes

Melissa Beer, Robert Davis, Thomas Elgin +5

In the 1970s, O'Keefe and Dostrovsky discovered that certain neurons, called place cells, in an animal's brain are tied to its location within its arena. A combinatorial neural cod…

math.CO2019★ 3 cited

On Hamiltonian Berge cycles in $3$ -uniform hypergraphs

Linyuan Lu, Zhiyu Wang

Given a set $R$ , a hypergraph is $R$ -uniform if the size of every hyperedge belongs to $R$ . A hypergraph $H$ is called \textit{covering} if every vertex pair is contained…

math.CO2018★ 2 cited

The extremal $p$ -spectral radius of Berge-hypergraphs

Liying Kang, Lele Liu, Linyuan Lu +1

Let $G$ be a graph. We say that a hypergraph $H$ is a Berge- $G$ if there is a bijection $ϕ : E (G) \to E (H)$ such that $e \subseteq ϕ (e)$ for all $e \in E (G)$ . For any $r$ -uniform hyper…

math.CO2018

Midrange crossing constants for graphs classes

Éva Czabarka, Josiah Reiswig, László Székely +1

For positive integers $n$ and $e$ , let $κ (n, e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges.…

math.CO2018★ 5 cited

Positional strategies in games of best choice

Aaron Fowlkes, Brant Jones

We study a variation of the game of best choice (also known as the secretary problem or game of googol) under an additional assumption that the ranks of interview candidates are re…

math.CO2018★ 2 cited

Using Block Designs in Crossing Number Bounds

John Asplund, Eva Czabarka, Gregory Clark +6

The crossing number ${\mbox {cr}}(G)$ of a graph $G = (V, E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k \geq 1$ , the $k$ -planar crossing…

math.CO2018★ 1 cited

A note on 1-guardable graphs in the cops and robber game

Linyuan Lu, Zhiyu Wang

In the cops and robber games played on a simple graph $G$ , Aigner and Fromme's lemma states that one cop can guard a shortest path in the sense that the robber cannot enter this pa…

math.CO2018★ 6 cited

Erdős-Szekeres theorem for cyclic permutations

Éva Czabarka, Zhiyu Wang

We provide a cyclic permutation analogue of the Erd\H os-Szekeres theorem. In particular, we show that every cyclic permutation of length $(k - 1) (ℓ - 1) + 2$ has either an increasing…

math.CO2018★ 7 cited

The maximum $p$ -Spectral Radius of Hypergraphs with $m$ Edges

Linyuan Lu

For $r \geq 2$ and $p \geq 1$ , the $p$ -spectral radius of an $r$ -uniform hypergraph $H = (V, E)$ on $n$ vertices is defined to be $$ρ_p(H)=\max_{{\bf x}\in \mathbb{R}^n: \|{\bf x}\|_p=1…

math.CO2018★ 12 cited

On difference graphs and the local dimension of posets

Jinha Kim, Ryan R. Martin, Tomáš Masařík +4

The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a vari…

math.CO2018★ 3 cited

The $α$ -normal labeling method for computing the $p$ -spectral radii of uniform hypergraphs

Lele Liu, Linyuan Lu

Let $G$ be an $r$ -uniform hypergraph of order $n$ . For each $p \geq 1$ , the $p$ -spectral radius $λ^{(p)} (G)$ is defined as \[ λ^{(p)}(G):=\max_{|x_1|^p+\cdots+|x_n|^p=1} r\sum_{\{i_…

math.CO2018★ 3 cited

Inducibility of d-ary trees

Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely +1

Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of $d$ -ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\ge…

math.CO2018★ 2 cited

Kazhdan-Lusztig polynomials of fan matroids, wheel matroids and whirl matroids

Linyuan Lu, Matthew H. Y. Xie, Arthur L. B. Yang

The Kazhdan-Lusztig polynomial of a matroid was introduced by Elias, Proudfoot and Wakefield, whose properties need to be further explored. In this paper we prove that the Kazhdan-…

math.CO2018★ 3 cited

Ricci-flat cubic graphs with girth five

David Cushing, Riikka Kangaslampi, Yong Lin +3

We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math.,…

math.CO2018

Anti-Ramsey number of edge-disjoint rainbow spanning trees

Linyuan Lu, Zhiyu Wang

An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees, denoted by $r (n, t)$ …

Outerplanar graphs with positive Lin-Lu-Yau curvature

Sizes of flat maximal antichains of subsets

A natural bijection for contiguous pattern avoidance in words

The saturation spectrum for antichains of subsets

The Edge-Distinguishing Chromatic Number of Petal Graphs, Chorded Cycles, and Spider Graphs

On the size of planar graphs with positive Lin-Lu-Yau Ricci curvature

Poset Ramsey Numbers for Boolean Lattices

Some remarks on the midrange crossing constant

Wiener Index and Remoteness in Triangulations and Quadrangulations

Universal Gröbner Bases of Toric Ideals of Combinatorial Neural Codes

On Hamiltonian Berge cycles in 3-uniform hypergraphs

The extremal p-spectral radius of Berge-hypergraphs

Midrange crossing constants for graphs classes

Positional strategies in games of best choice

Using Block Designs in Crossing Number Bounds

A note on 1-guardable graphs in the cops and robber game

Erdős-Szekeres theorem for cyclic permutations

The maximum p-Spectral Radius of Hypergraphs with m Edges

On difference graphs and the local dimension of posets

The α-normal labeling method for computing the p-spectral radii of uniform hypergraphs

Inducibility of d-ary trees

Kazhdan-Lusztig polynomials of fan matroids, wheel matroids and whirl matroids

Ricci-flat cubic graphs with girth five

Anti-Ramsey number of edge-disjoint rainbow spanning trees

On Hamiltonian Berge cycles in $3$ -uniform hypergraphs

The extremal $p$ -spectral radius of Berge-hypergraphs

The maximum $p$ -Spectral Radius of Hypergraphs with $m$ Edges

The $α$ -normal labeling method for computing the $p$ -spectral radii of uniform hypergraphs