Erdős–Gyárfás conjecture

Known as: Erdös conjecture (graph theory), Markström graph, Erdos conjecture (graph theory)

In graph theory, the unproven Erdős–Gyárfás conjecture, made in 1995 by the prolific mathematician Paul Erdős and his collaborator András Gyárfás…

Papers overview

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

2020

The disproved Nash-Williams conjecture states that every 4-regular 4-connected graph has a hamiltonian cycle. We show that a…

2015

The principal motivation of the present Ph.D subject is the study of certain interactions between number theory, algebraic…

2015

Let $$k\ge 2$$k≥2 be a positive integer and $$G$$G be a $$k$$k-connected graph. We prove that for any two cycles $$C$$C and $$D…

2015

String theory, arguably the most important stream of modern physics, searches for a unified law of all fundamental physical…

2013

We propose here a new approach in order to study line arrangements on the projective plane. We use this approach to prove Terao’s…

2012

2012

In this work in common with Daniele Faenzi we describe the logarithmic bundle associated to a arrangement of lines in P(C) as the…

2010

Abstract We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus…

2009

1978

Introduction. In [P] R. Peleg proves the following: If (X, T) and (Y, T) are metric minimal transformation groups supporting…