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.

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…

2011

In elementary group theory, containment defines a partial order relation on the subgroups of a fixed group. This order relation…

2004

For a simple graph G=(V,E),Ore theorem states that G is Hamiltonian if every pair of nonadjacent vertices u and v satisfies d(u…

2001

Let G(V,E) be simple graph,Ore studied Hamilton connected graphs with any nonadjacent two vertices.In this paper a simple proof…

1997

Many identities involving special functions can be proved using the theory of @-nite or holonomic sequences and functions. This…

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…

1986

1970

The role of Theorem B of Hall and Higman has been explained in detail to complete the proof of the fact that the hyperquasicenter…

1946

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