Results 91 to 100 of about 3,384,024 (197)
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Flips in colorful triangulations
Journal of Computational GeometryThe associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation.
Rohan Acharya +2 more
doaj +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
Pairs of forbidden induced subgraphs for homogeneously traceable graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Binlong +3 more
openaire +2 more sources
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set [PDF]
, 2014 Let fvs(G) and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph G, respectively. For a graph class \({\cal G}\), the price of connectivity for feedback vertex set (poc-fvs) for \({\cal G}\) is defined as the maximum ratio cfvs(G)/fvs(G) over all connected graphs G in \({\cal G ...
Rémy Belmonte +3 more
openaire +3 more sources
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
The Cop Number of Graphs with Forbidden Induced Subgraphs
CoRR, 2019 In the game of Cops and Robber, a team of cops attempts to capture a robber on a graph $G$. Initially, all cops occupy some vertices in $G$ and the robber occupies another vertex. In each round, a cop can move to one of its neighbors or stay idle, after which the robber does the same.
openaire +2 more sources
A Forbidden Subgraph Characterization Problem and a Minimal-Element Subset of Universal Graph Classes [PDF]
, 2004 The direct sum of a finite number of graph classes H_1, ..., H_k is defined as the set of all graphs formed by taking the union of graphs from each of the H_i. The join of these graph classes is similarly defined as the set of all graphs formed by taking
Barrus, Michael D.
core
An induced subgraph characterization of domination perfect graphs [PDF]
, 1995 Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G).
Vadim E. Zverovich +5 more
core +1 more source
List coloring ordered graphs with forbidden induced subgraphs
CoRRIn the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list. The complexity of the problem in classes defined by forbidding induced subgraphs is a widely studied topic in ...
Piecyk, Marta, Rzążewski, Paweł
openaire +3 more sources