Results 111 to 120 of about 102,063 (249)
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Network Evolution With Mesoscopic Delays
Random Structures &Algorithms, Volume 67, Issue 2, September 2025.ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic ...
Sayan Banerjee +3 more
wiley +1 more source
Qubit allocation as a combination of subgraph isomorphism and token swapping
Proc. ACM Program. Lang., 2019 In 2016, the first quantum processors have been made available to the general public. The possibility of programming an actual quantum device has elicited much enthusiasm. Yet, such possibility also brought challenges.
Marcos Yukio Siraichi +3 more
semanticscholar +1 more source
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
Matched Filters for Noisy Induced Subgraph Detection [PDF]
, 2018 The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince +3 more
core
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
Sidorenko's conjecture for higher tree decompositions [PDF]
, 2018 This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class ...
Conlon, David +3 more
core +1 more source
The subgraph isomorphism problem for outerplanar graphs
Theoretical Computer Science, 1982 AbstractThis paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete. We show that SUBOUTISOM remains NP-complete even when the strongest connectivity requirements are imposed on both graphs.
openaire +2 more sources
Deep Analysis on Subgraph Isomorphism
, 2020 Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all ...
Zeng, Li +3 more
openaire +2 more sources
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