Results 31 to 40 of about 16,183 (155)
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
, 2014 We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an
A. Bouland +15 more
core +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
(Random) Trees of Intermediate Volume Growth
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley +1 more source
Real models for the framed little n$n$‐disks operads
Journal of Topology, Volume 18, Issue 4, December 2025.Abstract We study the action of the orthogonal group on the little n$n$‐disks operads. As an application we provide small models (over the reals) for the framed little n$n$‐disks operads. It follows in particular that the framed little n$n$‐disks operads are formal (over the reals) for n$n$ even and coformal for all n$n$.
Anton Khoroshkin, Thomas Willwacher
wiley +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
Recent Advances in NASICON‐Type Electrolytes for Solid‐State Metal Batteries
Carbon Energy, Volume 7, Issue 11, November 2025.NASICON‐type solid electrolytes are one of the potential candidates for solid‐state rechargeable batteries, which are paid much attention by both academic and industrial communities. ABSTRACT Compared to traditional liquid electrolyte batteries, solid metal batteries offer advantages such as a wide operating temperature range, high energy density, and ...
Jingrui Kang +17 more
wiley +1 more source
Asymmetric graphs with quantum symmetry
Proceedings of the London Mathematical Society, Volume 131, Issue 5, November 2025.Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries.
Josse van Dobben de Bruyn +2 more
wiley +1 more source
Diameter and Treewidth in Minor-Closed Graph Families
, 1999 It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families.
Eppstein, David
core +2 more sources
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source