Results 41 to 50 of about 45,358 (192)
Saturated Partial Embeddings of Planar Graphs
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
Unexpected Primes of Good Reduction in Quotients of Modular and Shimura Curves
ABSTRACT We find all zero‐dimensional spaces of newforms of weight 2 and squarefree level N$N$ with a fixed Atkin–Lehner sign pattern. As an application, we classify unexpected primes of good reduction of Atkin–Lehner quotients of modular and Shimura curves of squarefree levels.
Oana Padurariu +2 more
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Trust, policy, and teamwork: Missing layers in standards for multi‐agent system interoperability
Abstract Multi‐agent system (MAS) interoperability falls short in three crucial areas: trust, policy, and teamwork. First, we argue that the requirement for trust goes far beyond the basic requirements of authentication. Importantly, accurate trust calibration requires access to robust, verifiable, continuously updated evidence based on experience ...
Jeffrey M. Bradshaw +8 more
wiley +1 more source
Mixed Steiner Triple Systems With Shortest Length
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
Promotion of Lattice Paths by Riordan Arrays
This paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy +3 more
doaj +1 more source
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source
Cycle Lengths in the Percolated Hypercube
ABSTRACT Let Qpd$$ {Q}_p^d $$ be the random subgraph of the d$$ d $$‐dimensional binary hypercube obtained after edge‐percolation with probability p$$ p $$. It was shown recently by the authors that, for every ε>0$$ \varepsilon >0 $$, there is some c=c(ε)>0$$ c=c\left(\varepsilon \right)>0 $$ such that, if pd≥c$$ pd\ge c $$, then typically Qpd$$ {Q}_p ...
Michael Anastos +5 more
wiley +1 more source

