Search
Search Results
-
-
-
Non-disjoint strong external difference families can have any number of sets
Strong external difference families (SEDFs) are much-studied combinatorial objects motivated by an information security application. A well-known...
-
Disjoint Edges in Geometric Graphs
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line...
-
Saturation numbers for disjoint stars
A graph G is called an H -saturated if G does not contain H as a subgraph, but the addition of any edge between two nonadjacent vertices in G results...
-
On Disjoint Cycles of the Same Length in Tournaments
A tournament is an orientation of the complete graph. Tournaments form perhaps the most interesting class of digraphs and it has a great potential...
-
On the Equitable Choosability of the Disjoint Union of Stars
Equitable k -choosability is a list analogue of equitable k -coloring that was introduced by Kostochka et al. (J Graph Theory 44:166–177, 2003). It is...
-
Disjoint paths in the enhanced hypercube with a faulty subgraph
Problems about embedding of disjoint paths in interconnection networks have received much attention in recent years. A connected graph G is strong...
-
-
Quasi-Energy Function for Morse–Smale 3-Diffeomorphisms with Fixed Points with Pairwise Distinct Indices
AbstractThe present paper is devoted to a lower bound for the number of critical points of the Lyapunov function for Morse–Smale 3-diffeomorphisms...
-
Disjoint Blocks in a MOL(6)
We prove that the maximal number of pairwise disjoint 4-blocks in a MOL(6) is 3. We recall various proofs for the non-existence of a MOL(6) and show:...
-
An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
Planning for multiple commodities simultaneously is a challenging task arising in divers applications, including robot motion or various forms of...
-
-
Disjoint Stable Matchings in Linear Time
We show that given a Stable Matching instance \(G\) as input, we...
-
An \(O(\sqrt{k})\) -Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths
In minimum power network design problems we are given an undirected graph...
-
Periodic Golay pairs and pairwise balanced designs
In this paper we exploit a relationship between certain pairwise balanced designs with v points and periodic Golay pairs of length v , to classify...
-
-
Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters
A cluster is a set of points, with a predefined similarity measure. In this paper, we study the problem of computing the largest possible convex...
-
Distributions of Countable Models of Disjoint Unions of Ehrenfeucht Theories
AbstractWe describe Rudin–Keisler preorders and distribution functions of numbers of limit models for disjoint unions of Ehrenfeucht theories....
