Results 31 to 40 of about 16,397 (156)
On the universal pairing for 2‐complexes
Bulletin of the London Mathematical Society, EarlyView.Abstract The universal pairing for manifolds was defined and shown to lack positivity in dimension 4 in [Freedman, Kitaev, Nayak, Slingerland, Walker, and Wang, J. Geom. Topol. 9 (2005), 2303–2317]. We prove an analogous result for 2‐complexes, and show that the universal pairing does not detect the difference between simple homotopy equivalence and 3 ...
Mikhail Khovanov +2 more
wiley +1 more source
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core
The Descriptive Complexity of Subgraph Isomorphism without Numerics
, 2017 Let $F$ be a connected graph with $\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\ell$, simply because no first-order formula of smaller quantifier depth can ...
Verbitsky, Oleg, Zhukovskii, Maksim
core +1 more source
The subgraph isomorphism problem for outerplanar graphs [PDF]
, 1982 This paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete.
SysŁ
core +1 more source
A Sharper Ramsey Theorem for Constrained Drawings
Journal of Graph Theory, Volume 109, Issue 4, Page 401-411, August 2025.ABSTRACT Given a graph G and a collection C of subsets of R d indexed by the subsets of vertices of G, a constrained drawing of G is a drawing where each edge is drawn inside some set from C, in such a way that nonadjacent edges are drawn in sets with disjoint indices. In this paper we prove a Ramsey‐type result for such drawings.
Pavel Paták
wiley +1 more source
Solution-Graphs of Boolean Formulas and Isomorphism
International Conference on Theory and Applications of Satisfiability Testing, 2016 The solution-graph of a Boolean formula on n variables is the subgraph of the hypercube H n induced by the satisfying assignments of the formula. The structure of solution-graphs has been the object of much research in recent years since it is important ...
Patrick Scharpfenecker, J. Torán
semanticscholar +1 more source
Bounding Clique-Width via Perfect Graphs [PDF]
Language and Automata Theory and Applications, 2014 Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of $(H_1,H_2)$-free ...
Konrad Dabrowski +2 more
semanticscholar +1 more source
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
Security in Metaverse Markets: Challenges and Solutions—A Comprehensive Review
Expert Systems, Volume 42, Issue 8, August 2025.ABSTRACT This review paper provides a systematic overview of the metaverse markets security problems and solutions. The metaverse is an emerging digital space, bridging virtual, augmented and mixed reality environments. As the metaverse evolves, issues related to customer security have emerged, which include breaches of privacy, thefts of identity and ...
Mohammad Z. Aloudat +3 more
wiley +1 more source
A Jump of the Saturation Number in Random Graphs?
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT For graphs G$$ G $$ and F$$ F $$, the saturation number sat(G,F)$$ sat\left(G,F\right) $$ is the minimum number of edges in an inclusion‐maximal F$$ F $$‐free subgraph of G$$ G $$. In 2017, Korándi and Sudakov initiated the study of saturation in random graphs. They showed that for constant p∈(0,1)$$ p\in \left(0,1\right) $$, whp satG(n,p),Ks=(
Sahar Diskin +2 more
wiley +1 more source