Ore's theorem

Known as: Ore theorem

Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2017

Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a…

2016

This paper proves a dual version of a theorem of Oystein Ore for every distributive interval of finite groups [H,G] of index |G:H…

2015

This paper introduces the cyclic subfactors, generalizing the cyclic groups as the subfactors generalize the groups, and…

2007

1996

{For an integer i, a graph is called an Li-graph if, for each triple of vertices u, v, w with d(u, v) = 2 and w (element of) N(u…

1995

This paper discusses an extension of the Dulmage--Mendelsohn decomposition for a certain class of matrices whose row-set and…

1992

Synopsis : In order to clarify the influences of iron ores on their sintering performance based on their mineralogical properties…

1986

1946

The Kurosch-Ore theorem1 asserts that if an element of a modular lattice has two decompositions into irreducibles, then each…