EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 101 – 120 of 189

Linear forests and ordered cycles

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda Lesniak, Florian Pfender (2004)

Discussiones Mathematicae Graph Theory

A collection $L = P ¹ \cup P ² \cup . . . \cup P^{t}$ (1 ≤ t ≤ k) of t disjoint paths, s of them being singletons with |V(L)| = k is called a (k,t,s)-linear forest. A graph G is (k,t,s)-ordered if for every (k,t,s)-linear forest L in G there exists a cycle C in G that contains the paths of L in the designated order as subpaths. If the cycle is also a hamiltonian cycle, then G is said to be (k,t,s)-ordered hamiltonian. We give sharp sum of degree conditions for nonadjacent vertices that imply a graph is (k,t,s)-ordered hamiltonian.

Linear independences in bottleneck algebra and their coherences with matroids.

Plávka, J. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Linear operator identities in quasigroups

Reza Akhtar (2022)

Commentationes Mathematicae Universitatis Carolinae

We study identities of the form $L_{x_{0}} ϕ_{1} \dots ϕ_{n} R_{x_{n + 1}} = R_{x_{n + 1}} ϕ_{σ (1)} \dots ϕ_{σ (n)} L_{x_{0}}$ in quasigroups, where $n \geq 1$ , $σ$ is a permutation of ${1, ..., n}$ , and for each $i$ , $ϕ_{i}$ is either $L_{x_{i}}$ or $R_{x_{i}}$ . We prove that in a quasigroup, every such identity implies commutativity. Moreover, if $σ$ is chosen randomly and uniformly, it also satisfies associativity with probability approaching $1$ as $n \to \infty$ .

Linear preserver of $n \times 1$ Ferrers vectors

Leila Fazlpar, Ali Armandnejad (2023)

Czechoslovak Mathematical Journal

Let $A = {[a_{i j}]}_{m \times n}$ be an $m \times n$ matrix of zeros and ones. The matrix $A$ is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero $(1, 1)$ -entry. We characterize all linear maps perserving the set of $n \times 1$ Ferrers vectors over the binary Boolean semiring and over the Boolean ring $ℤ_{2}$ . Also, we have achieved the number of these linear maps in each case.

Linear programming and the worst-case analysis of greedy algorithms on cubic graphs.

Duckworth, W., Wormald, N. (2010)

The Electronic Journal of Combinatorics [electronic only]

Linear programming duality and morphisms

Winfried Hochstättler, Jaroslav Nešetřil (1999)

Commentationes Mathematicae Universitatis Carolinae

In this paper we investigate a class of problems permitting a good characterisation from the point of view of morphisms of oriented matroids. We prove several morphism-duality theorems for oriented matroids. These generalize LP-duality (in form of Farkas' Lemma) and Minty's Painting Lemma. Moreover, we characterize all morphism duality theorems, thus proving the essential unicity of Farkas' Lemma. This research helped to isolate perhaps the most natural definition of strong maps for oriented matroids....

Linear recurrent sequences and powers of a square matrix.

Belbachir, Hacène, Bencherif, Farid (2006)

Integers

Linear time recognition of $P_{4}$ -indifference graphs.

Habib, Michael, Paul, Christophe, Viennot, Laurent (2001)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Linearly independent products of rectangularly complementary Schur functions.

Kleber, Michael (2002)

The Electronic Journal of Combinatorics [electronic only]

Line-Coloring of Signed Graphs.

G. Chartrand, M. Behzad (1969)

Elemente der Mathematik

Link homotopy invariants of graphs in R3.

Kouki Taniyama (1994)

Revista Matemática de la Universidad Complutense de Madrid

In this paper we define a link homotopy invariant of spatial graphs based on the second degree coefficient of the Conway polynomial of a knot.

List 2-distance $(Δ + 2)$ -coloring of planar graphs with girth 6 and $Δ \geq 24$ .

Borodin, O.V., Ivanova, A.O. (2009)

Sibirskij Matematicheskij Zhurnal

List coloring of complete multipartite graphs

Tomáš Vetrík (2012)

Discussiones Mathematicae Graph Theory

The choice number of a graph G is the smallest integer k such that for every assignment of a list L(v) of k colors to each vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from L(v). We present upper and lower bounds on the choice number of complete multipartite graphs with partite classes of equal sizes and complete r-partite graphs with r-1 partite classes of order two.

List edge-colorings of series-parallel graphs.

Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)

The Electronic Journal of Combinatorics [electronic only]

List $(p, q)$ -coloring of sparse plane graphs.

Borodin, O.V., Ivanova, A.O., Neustroeva, T.K. (2006)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Listing all plane graphs.

Yamanaka, Katsuhisa, Nakano, Shin-Ichi (2009)

Journal of Graph Algorithms and Applications

Littlewood-Richardson coefficients and integrable tilings.

Zinn-Justin, Paul (2009)

The Electronic Journal of Combinatorics [electronic only]

Littlewood-Richardson without algorithmically defined bijections.

Hoffman, Peter (1988)

Séminaire Lotharingien de Combinatoire [electronic only]

Local admissible convergence of harmonic functions on non-homogeneous trees

Massimo A. Picardello (2010)

Colloquium Mathematicae

We prove admissible convergence to the boundary of functions that are harmonic on a subset of a non-homogeneous tree equipped with a transition operator that satisfies uniform bounds suitable for transience. The approach is based on a discrete Green formula, suitable estimates for the Green and Poisson kernel and an analogue of the Lusin area function.

Local algebras and a new version of Young's orthogonal form

A. M. Vershik (1990)

Banach Center Publications

Currently displaying 101 – 120 of 189

Previous Page 6 Next