Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,636,636 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Cycle (graph theory)
Degree (graph theory)
Directed graph
Graph (discrete mathematics)
Expand
Broader (1)
Extremal graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem
Hsiu-Chunj Pan
,
Hsun Su
,
Shin-Shin Kao
Journal of information science and engineering
2018
Corpus ID: 56199949
For any undirected and simple graph G = (V;E), where V denotes the vertex set and E the edge set of G. G is called hamiltonian if…
Expand
2016
2016
Dual Ore's theorem for distributive intervals of small index
S. Palcoux
2016
Corpus ID: 119318071
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…
Expand
2011
2011
Ore's theorem
Jarom Viehweg
2011
Corpus ID: 125678728
In elementary group theory, containment defines a partial order relation on the subgroups of a fixed group. This order relation…
Expand
2005
2005
On local nature of some classical theorems on Hamilton cycles.
A. Asratian
,
N. Khachatryan
2005
Corpus ID: 263860165
The following result gives a flavour of what is in this paper. Ore's theorem is that if $d(u)+d(v)\ge|G|$ for all non-adjacent $u…
Expand
2003
2003
Note on Faudree-Schelp Theorem in Path Connected Graphs and Ore Theorem in Hamilton Connected Graphs
Zeng Ke-yang
2003
Corpus ID: 123877577
2003
2003
Note on Faudree—Schelp Theorem in Path Connected Graphs and Ore Theorem in Hamilton Connected Graphs
ZHAOKe-wen
,
ZENGKe-yang
2003
Corpus ID: 119056790
2001
2001
Simple Proof for Ore Theorem
Zhao Ke
2001
Corpus ID: 123344449
Let G(V,E) be simple graph,Ore studied Hamilton connected graphs with any nonadjacent two vertices.In this paper a simple proof…
Expand
1997
1997
Non-commutative Elimination in Ore Algebras Proves Multivariate Identities Non-commutative Elimination in Ore Algebras Proves Multivariate Identities Non-commutative Elimination in Ore Algebras…
Bruno SALVYAbstract
1997
Corpus ID: 268130200
Many identities involving special functions can be proved using the theory of @-nite or holonomic sequences and functions. This…
Expand
1970
1970
The hyperquasicenter of a finite group. II
N. Mukherjee
1970
Corpus ID: 115149181
The role of Theorem B of Hall and Higman has been explained in detail to complete the proof of the fact that the hyperquasicenter…
Expand