1997
DOI: 10.1016/s0012-365x(96)00056-8
|View full text |Cite
|
Sign up to set email alerts
|

Highly irregular graphs with extreme numbers of edges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 2 publications
0
10
0
Order By: Relevance
“…Paul Erdos emphasized this in the study of irregular graphs for the first time in history in [25]. In the Second Krakow Conference on Graph eory, Erdos officially posed an open problem to " determine the extreme size of highly irregular graphs of given order" [26][27][28]. Since then, irregular graphs and the degree of irregularity have become one of the core open problems of graph theory.…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…Paul Erdos emphasized this in the study of irregular graphs for the first time in history in [25]. In the Second Krakow Conference on Graph eory, Erdos officially posed an open problem to " determine the extreme size of highly irregular graphs of given order" [26][27][28]. Since then, irregular graphs and the degree of irregularity have become one of the core open problems of graph theory.…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…Paul Erdos emphasized the study of irregular graphs for the first time in history in [22]. At the Second Krakow Conference on Graph Theory (1994), Erdos officially posed an open problem about determination of the extreme size of highly irregular graphs of given order [23]. Since then, the irregular graphs and the degree of irregularity have become the basic open problem of graph theory.…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…This concept was, in an implicit manner, used in the early works [5,6,39,40], but was explicitly considered only quite recently [36,37,41,42].…”
Section: Irregularity Indexmentioning
confidence: 99%
“…Such "opposite" graphs should be highly irregular. During the Second Krakow Conference on Graph Theory (1994), Erdős officially posed as an open problem the determination of the extreme size of highly irregular graphs of given order [40].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation