Results 211 to 220 of about 8,313 (308)

Unavoidable induced subgraphs in large graphs with no homogeneous sets [PDF]

, 2016
Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul Seymour   +3 more
openalex   +1 more source

Complexity of Finding Maximum Locally Irregular Induced Subgraphs 1

, 2023
Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis   +2 more
openalex   +1 more source

The N‐prime graph and the Subgroup Isomorphism Problem

Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici, Ángel del Río, Marco Vergani   +2 more
wiley   +1 more source

Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets

, 2022
Remie Janssen, Leonie van Steijn
openalex   +2 more sources

Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs II: paws [PDF]

, 2020
Karl Heuer, Deniz Sarikaya
openalex   +1 more source

Towards the boundary of the fine curve graph

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract The fine curve graph was introduced as a geometric tool to study homeomorphisms of surfaces. In this paper, we study the Gromov boundary of this space and the local topology near points associated with certain foliations and laminations. We then give several applications including finding dynamically explicit elements with positive stable ...
Jonathan Bowden, Sebastian Hensel, Richard Webb   +2 more
wiley   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

J Chem Theory Comput
Golnik R, Gatter T, Stadler PF, Vassena N.   +3 more
europepmc   +1 more source

The pants graph of a free group

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants graph of a free group, consisting of all possible pants decompositions.
Donggyun Seo
wiley   +1 more source

Note on extremal problems about connected subgraph sums. [PDF]

Graphs Comb
Cambie S, Groenland C.
europepmc   +1 more source

Thurston norm for coherent right‐angled Artin groups via L2$L^2$‐invariants

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract We define a new notion of splitting complexity for a group G$G$ along a non‐trivial integral character ϕ∈H1(G;Z)$\phi \in H^1(G; \mathbb {Z})$. If G$G$ is a one‐ended coherent right‐angled Artin group, we show that the splitting complexity along an epimorphism ϕ:G→Z$\phi \colon G \rightarrow \mathbb {Z}$ equals the L2$L^2$‐Euler characteristic
Monika Kudlinska
wiley   +1 more source