• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Lovász conjecture     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFiniteGroups, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:WikicatConjecturesyago:Abstraction100002137yago:Act100030358yago:Action100037396yago:Cognition100023271yago:Concept105835747yago:Content105809192yago:Course100038262yago:Event100029378yago:Group100031264yago:Hypothesis105888929yago:Idea105833840yago:PsychologicalFeature100023100yago:WikicatHamiltonianPathsAndCyclesyago:YagoPermanentlyLocatedEntitydiseaseyago:Speculation105891783yago:Way100415676yago:WikicatFiniteGroups New Facet based on Instances of this Class

In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive graph contains a Hamiltonian path. Originally László Lovász stated the problem in the opposite way, butthis version became standard. In 1996, László Babai published a conjecture sharply contradicting this conjecture, but both conjectures remain widely open. It is not even known if a single counterexample would necessarily lead to a series of counterexamples.