The non-parametrizability of the word equation <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="italic">xyz</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="italic">zvx</mml:mi></mml:math>: A short proof

In this paper we give a short proof of the main results of Kumam, Dung and Sitthithakerngkiet (P. Kumam, N.V. Dung, K. Sitthithakerngkiet, A Generalization of Ciric Fixed Point Theorems, FILOMAT 29:7 (2015), 1549-1556).

Download Full-text

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k

Discrete Mathematics ◽

10.1016/j.disc.2021.112430 ◽

2021 ◽

Vol 344 (7) ◽

pp. 112430

Author(s):

Johann Bellmann ◽

Bjarne Schülke

Keyword(s):

Short Proof ◽

Kneser Graphs

Download Full-text

Strongly perfect claw‐free graphs—A short proof

Journal of Graph Theory ◽

10.1002/jgt.22659 ◽

2021 ◽

Author(s):

Maria Chudnovsky ◽

Cemil Dibek

Keyword(s):

Short Proof

Download Full-text

A short note on extreme points of certain polytopes

Special Matrices ◽

10.1515/spma-2020-0005 ◽

2020 ◽

Vol 8 (1) ◽

pp. 36-39

Author(s):

Lei Cao ◽

Ariana Hall ◽

Selcuk Koyuncu

Keyword(s):

Short Proof ◽

Convex Polytopes ◽

Short Note ◽

Convex Polytope ◽

Extreme Points ◽

Alternative Proof ◽

Stochastic Matrices ◽

Doubly Stochastic ◽

Birkhoff's Theorem ◽

Birkhoff’S Theorem

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.

Download Full-text