Search Results - "Narins, Lothar"

A Density Turán Theorem by Narins, Lothar, Tran, Tuan

“…Let F be a graph that contains an edge whose deletion reduces its chromatic number. For such a graph F, a classical result of Simonovits from 1966 shows that…”
Get full text

Graphs without proper subgraphs of minimum degree 3 and short cycles by Narins, Lothar, Pokrovskiy, Alexey, Szabó, Tibor

“…We study graphs on n vertices which have 2 n −2 edges and no proper induced subgraphs of minimum degree 3. Erdős, Faudree, Gyárfás, and Schelp conjectured that…”
Get full text

Strong Ramsey games: Drawing on an infinite board by Hefetz, Dan, Kusch, Christopher, Narins, Lothar, Pokrovskiy, Alexey, Requilé, Clément, Sarid, Amir

“…Consider the following strong Ramsey game. Two players take turns in claiming a previously unclaimed edge of the complete graph on n vertices until all edges…”
Get full text

A Stability Theorem for Matchings in Tripartite 3-Graphs by Haxell, Penny, Narins, Lothar

“…It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$…”
Get full text

Case Study: Leveraging GenAI to Build AI-based Surrogates and Regressors for Modeling Radio Frequency Heating in Fusion Energy Science by Bethel, E. Wes, Cramer, Vianna, del Rio, Alexander, Narins, Lothar, Pestano, Chris, Verma, Satvik, Arias, Erick, Bertelli, Nicola, Perciano, Talita, Shiraiwa, Syun'ichi, Villar, Álvaro Sánchez, Wallace, Greg, Wright, John C

“…This work presents a detailed case study on using Generative AI (GenAI) to develop AI surrogates for simulation models in fusion energy research. The scope…”
Get full text

A Density Tur\'an Theorem by Narins, Lothar, Tran, Tuan

“…J. Graph Theory 85 (2017), 496-524 Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph $F,$ a classical…”
Get full text

NarrationBot and InfoBot: A Hybrid System for Automated Video Description by Ihorn, Shasta, Siu, Yue-Ting, Bodi, Aditya, Narins, Lothar, Castanon, Jose M, Kant, Yash, Das, Abhishek, Yoon, Ilmi, Fazli, Pooyan

“…Video accessibility is crucial for blind and low vision users for equitable engagements in education, employment, and entertainment. Despite the availability…”
Get full text

On the connectivity Waiter-Client game by Antoniuk, Sylwia, Grosu, Codruut, Narins, Lothar

“…In this short note we consider a variation of the connectivity Waiter-Client game $WC(n,q,\mathcal{A})$ played on an $n$-vertex graph $G$ which consists of…”
Get full text

Graphs without proper subgraphs of minimum degree 3 and short cycles by Narins, Lothar, Pokrovskiy, Alexey, Szabó, Tibor

“…We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp…”
Get full text

Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs by Haxell, Penny, Narins, Lothar, Szabó, Tibor

“…In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the…”
Get full text

Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs by Haxell, Penny, Narins, Lothar, Szabó, Tibor

“…Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r…”
Get full text

Approximation and Hardness for Token Swapping by Miltzow, Tillmann, Narins, Lothar, Okamoto, Yoshio, Rote, Günter, Thomas, Antonis, Uno, Takeaki

“…Algorithms-ESA 2016, Proc. 24th Annual European Symposium on Algorithms, Aarhus, 2016, Leibniz International Proceedings in Informatics (LIPIcs), pp…”
Get full text

Strong Ramsey Games: Drawing on an infinite board by Hefetz, Dan, Kusch, Christopher, Narins, Lothar, Pokrovskiy, Alexey, Requilé, Clément, Sarid, Amir

“…We consider the strong Ramsey-type game $\mathcal{R}^{(k)}(\mathcal{H}, \aleph_0)$, played on the edge set of the infinite complete $k$-uniform hypergraph…”
Get full text