Search Results - "Stolee, Derrick"

Ramsey Numbers for Partially-Ordered Sets by Cox, Christopher, Stolee, Derrick

“…We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey…”
Get full text

Ordered Ramsey numbers of loose paths and matchings by Cox, Christopher, Stolee, Derrick

“…For a k-uniform hypergraph G with vertex set {1,…,n}, the ordered Ramsey number ORt(G) is the least integer N such that every t-coloring of the edges of the…”
Get full text

On Choosability with Separation of Planar Graphs with Forbidden Cycles by Choi, Ilkyoo, Lidický, Bernard, Stolee, Derrick

“…We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)‐list assignment L of a graph G is a function that…”
Get full text

On the independence ratio of distance graphs by Carraher, James M., Galvin, David, Hartke, Stephen G., Radcliffe, A.J., Stolee, Derrick

“…A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence…”
Get full text

A linear programming approach to the Manickam–Miklós–Singhi conjecture by Hartke, Stephen G., Stolee, Derrick

“…The Manickam–Miklós–Singhi conjecture states that when n≥4k, every multiset of n real numbers with nonnegative total sum has at least (n−1k−1)k-subsets with…”
Get full text

On the Strong Chromatic Index of Sparse Graphs by DeOrsey, Philip, Ferrara, Michael, Graber, Nathan, Hartke, Stephen G., Nelsen, Luke L., Sullivan, Eric, Jahanbekam, Sogol, Lidický, Bernard, Stolee, Derrick, White, Jennifer

“…The strong chromatic index of a graph $G$, denoted $\chi'_s(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two…”
Get full text

Color-blind index in graphs of very low degree by Diemunsch, Jennifer, Graber, Nathan, Kramer, Lucas, Larsen, Victor, Nelsen, Lauren M., Nelsen, Luke L., Sigler, Devon, Stolee, Derrick, Suer, Charlie

“…Let c:E(G)→[k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v)=(a1,…,ak), where ai is the number of edges incident to v…”
Get full text

Partitioning a Graph into Highly Connected Subgraphs by Borozan, Valentin, Ferrara, Michael, Fujita, Shinya, Furuya, Michitaka, Manoussakis, Yannis, N, Narayanan, Stolee, Derrick

“…Given k≥1, a k‐proper partition of a graph G is a partition P of V(G) such that each part P of P induces a k‐connected subgraph of G. We prove that if G is a…”
Get full text

ReachFewL = ReachUL by Garvin, Brady, Stolee, Derrick, Tewari, Raghunath, Vinodchandran, N. V.

“…We show that two complexity classes introduced about two decades ago are unconditionally equal. ReachUL is the class of problems decided by nondeterministic…”
Get full text

I,F-partitions of sparse graphs by Brandt, Axel, Ferrara, Michael, Kumbhat, Mohit, Loeb, Sarah, Stolee, Derrick, Yancey, Matthew

“…A stark-coloring is a proper k-coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar…”
Get full text

On the hardness of recognizing triangular line graphs by Anand, Pranav, Escuadro, Henry, Gera, Ralucca, Hartke, Stephen G., Stolee, Derrick

“…Given a graph G, its triangular line graph is the graph T(G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G…”
Get full text

(4, 2)-Choosability of Planar Graphs with Forbidden Structures by Berikkyzy, Zhanar, Cox, Christopher, Dairyko, Michael, Hogenson, Kirsten, Kumbhat, Mohit, Lidický, Bernard, Messerschmidt, Kacy, Moss, Kevin, Nowak, Kathleen, Palmowski, Kevin F., Stolee, Derrick

“…All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can…”
Get full text

List distinguishing parameters of trees by Ferrara, Michael, Gethner, Ellen, Hartke, Stephen G., Stolee, Derrick, Wenger, Paul S.

“…A coloring of the vertices of a graph G is said to be distinguishing provided no nontrivial automorphism of G preserves all of the vertex colors. The…”
Get full text

Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs by Stolee, D., Vinodchandran, N. V.

“…This work presents a log-space reduction which compresses an n-vertex directed acyclic graph with m(n) sources embedded on a surface of genus g(n), to a graph…”
Get full text

Extremal Graphs With a Given Number of Perfect Matchings by Hartke, Stephen G., Stolee, Derrick, West, Douglas B., Yancey, Matthew

“…Let f(n,p) denote the maximum number of edges in a graph having n vertices and exactly p perfect matchings. For fixed p, Dudek and Schmitt showed that…”
Get full text

Combinatorics using computational methods by Stolee, Derrick

“…Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis…”
Get full text

Automated Discharging Arguments for Density Problems in Grids by Stolee, Derrick

“…Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the…”
Get full text

Ramsey numbers for partially-ordered sets by Cox, Christopher, Stolee, Derrick

“…We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey…”
Get full text

A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources by Stolee, Derrick, Bourke, Chris, Vinodchandran, N V

“…Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed…”
Get full text

Automorphism Groups and Adversarial Vertex Deletions by Stolee, Derrick

“…Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a…”
Get full text