Results 41 to 50 of about 167 (120)
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan +5 more
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Tracing the birth of structural domains from loops during protein evolution. [PDF]
Sci Rep, 2023 Aziz MF, Mughal F, Caetano-Anollés G.
europepmc +1 more source
Normal components, Kekule patterns, and Clar patterns in plane bipartite graphs
, 2002 As a general case of molecular graphs of polycyclic alternant hydrocarbons, we consider a plane bipartite graph G with a Kekule pattern (perfect matching).
Lam, PCB +4 more
core
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides an effective graph‐theoretic framework for resilient localization and monitoring in such ...
Ghulam Haidar +5 more
wiley +1 more source
Gluing posets and the dichotomy of poset saturation numbers
Mathematika, Volume 72, Issue 3, July 2026.Abstract Given a finite poset P$\mathcal {P}$, we say that a family F$\mathcal {F}$ of subsets of [n]$[n]$ is P$\mathcal {P}$‐saturated if F$\mathcal {F}$ does not contain an induced copy of P$\mathcal {P}$, but adding any other set to F$\mathcal {F}$ creates an induced copy of P$\mathcal {P}$.
Maria‐Romina Ivan, Sean Jaffe
wiley +1 more source
Maximum Matchings in Geometric Intersection Graphs. [PDF]
Discrete Comput Geom, 2023 Bonnet É, Cabello S, Mulzer W.
europepmc +1 more source