Results 41 to 50 of about 11,556 (115)
On the universal pairing for 2‐complexes
Bulletin of the London Mathematical Society, Volume 57, Issue 9, Page 2838-2853, September 2025.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 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
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
A counterexample to the reconstruction conjecture for locally finite trees
, 2017 Two graphs $G$ and $H$ are hypomorphic if there exists a bijection $\varphi \colon V(G) \rightarrow V(H)$ such that $G - v \cong H - \varphi(v)$ for each $v \in V(G)$. A graph $G$ is reconstructible if $H \cong G$ for all $H$ hypomorphic to $G$.
Bowler, Nathan +4 more
core +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
Defining Recursive Predicates in Graph Orders
, 2018 We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary.
Thinniyam, Ramanathan S.
core +1 more source
Canonical Labeling of Latin Squares in Average‐Case Polynomial Time
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT A Latin square of order n$$ n $$ is an n×n$$ n\times n $$ matrix in which each row and column contains each of n$$ n $$ symbols exactly once. For ε>0$$ \varepsilon >0 $$, we show that with high probability a uniformly random Latin square of order n$$ n $$ has no proper subsquare of order larger than n1/2log1/2+εn$$ {n}^{1/2}{\log}^{1/2 ...
Michael J. Gill +2 more
wiley +1 more source
Equivariant geometry of singular cubic threefolds, II
Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.Abstract We study linearizability of actions of finite groups on cubic threefolds with nonnodal isolated singularities.
Ivan Cheltsov +3 more
wiley +1 more source
Action planning for graph transition systems [PDF]
, 2005 Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Edelkamp, Stefan +2 more
core +1 more source