Results 81 to 90 of about 566 (185)
Журнал Белорусского государственного университета: Математика, информатика, 2018 Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj
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
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT We study the contact process on the long‐range percolation cluster on ℤ$$ \mathbb{Z} $$ where each edge ⟨i,j⟩$$ \left\langle i,j\right\rangle $$ is open with probability |i−j|−s$$ {\left|i-j\right|}^{-s} $$ for s>2$$ s>2 $$. Using a renormalization procedure, we apply the Peierls‐type argument to prove that the contact process dies out if the ...
Pablo A. Gomes +3 more
wiley +1 more source
Forbidden triples and traceability: a characterization
, 1999 Given a connected graph G, a family F of connected graphs is called a forbidden family if no induced subgraph of G is isomorphic to any graph in F. If this is the case, G is said to be F-free.
Ronald J. Gould +3 more
core +1 more source
Diophantine tuples and product sets in shifted powers
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley +1 more source
Contracting Few Edges to Remove Forbidden Induced Subgraphs [PDF]
, 2013 For a given graph property Π (i.e., a collection Π of graphs), the Π-Contraction problem is to determine whether the input graph G can be transformed into a graph satisfying property Π by contracting at most k edges, where k is a parameter. In this paper, we mainly focus on the parameterized complexity of Π-Contraction problems for Π being H-free (i.e.,
Leizhen Cai, Chengwei Guo
openaire +1 more source
Vertex colouring and forbidden subgraphs - a survey [PDF]
, 2004 There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph ...
Randerath, Bert, Schiermeyer, Ingo
core
Coloring and density theorems for configurations of a given volume
Proceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.Abstract This is a treatise on finite point configurations spanning a fixed volume to be found in a single color‐class of an arbitrary finite (measurable) coloring of the Euclidean space Rn$\mathbb {R}^n$, or in a single large measurable subset A⊆Rn$A\subseteq \mathbb {R}^n$.
Vjekoslav Kovač
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
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