Exponents of two-colored digraphs
We consider the primitive two-colored digraphs whose uncolored digraph has vertices and consists of one -cycle and one -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.
Extended finite operator calculus-an example of algebraization of analysis
“A Calculus of Sequences” started in 1936 by Ward constitutes the general scheme for extensions of classical operator calculus of Rota-Mullin considered by many afterwards and after Ward. Because of the notation we shall call the Ward's calculus of sequences in its afterwards elaborated form-a ψ-calculus. The ψ-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota-Mullin or equivalently-of umbral calculus of Roman and Rota. At the same time this...
Extended near hexagons and line systems.
Extended Ramsey theory for words representing rationals
Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting the Budak-Işik-Pym...
Extended trees of graphs
An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.
Extending a recent result of Santos on partitions into odd parts.
Extending Hall's theorem into list colorings: a partial history.
Extending the dual of the Petersen graph.
Extending the MAX Algorithm for Maximum Independent Set
The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.
Extension of line-splitting operation from graphs to binary matroids.
Extension of Partial Diagonals of Matrices I.
Extension of Partial Diagonals of Matrices II.
Extension of several sufficient conditions for Hamiltonian graphs
Let G be a 2-connected graph of order n. Suppose that for all 3-independent sets X in G, there exists a vertex u in X such that |N(X∖u)|+d(u) ≥ n-1. Using the concept of dual closure, we prove that 1. G is hamiltonian if and only if its 0-dual closure is either complete or the cycle C₇ 2. G is nonhamiltonian if and only if its 0-dual closure is either the graph , 1 ≤ r ≤ s ≤ t or the graph . It follows that it takes a polynomial time to check the hamiltonicity or the nonhamiltonicity of a graph...
Extension of strongly regular graphs.
Extension of -labelings of quadratic graphs.
Extension Spaces of Oriented Matroids.
Extensions de quelques théorèmes de densité
Extensions of Foster's averaging formula to infinite networks with moderate growth.
Extensions of -subsets to -subsets - existence versus constructability
Extensions of the Graham-Leeb-Rothschild theorem.