Triangle-Free Graphs with High Minimal Degrees
Copyright policy ) Jin, Guoping;
Triangle-Free Graphs with High Minimal Degrees
The main result of this paper gives a structure of a triangle-free graph of order n with minimal degree greater than 10n/29. This extends results given by Andrásfai et al. [1] and Häggkvist [6].
- University of Cambridge United Kingdom
Extremal problems in graph theory, triangle-free graph, minimal degree
Extremal problems in graph theory, triangle-free graph, minimal degree
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 8
Average
Top 10%
Average
Fields of Science (3) View all
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?