On degree sums of a triangle-free graph
type: Item
instance of: scholarly article
title: On degree sums of a triangle-free graph
zbMATH Open document ID: 1301.05072
author: Stephan Brandt
author: Jochen Harant
author: Steffi Naumann
published in: Discrete Mathematics
publication date: 2014-10-31T00:00:00Z
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6362907
zbMATH Keywords: degree sum
zbMATH Keywords: triangle-free graph
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
full work available at URL: j.disc.2014.08.010
OpenAlex ID: W2042289434
cites work: A note on Ramsey numbers
cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph
cites work: An upper bound on the sum of squares of degrees in a hypergraph
cites work: A 4-colour problem for dense triangle-free graphs
cites work: Q5782525
cites work: Q4050624
cites work: Sums of powers of the degrees of a graph
cites work: Maximizing the sum of the squares of the degrees of a graph
cites work: An upper bound on the sum of squares of degrees in a graph
cites work: Q3577833
cites work: Upper bounds on the sum of powers of the degrees of a simple planar graph
cites work: Small graphs with chromatic number 5: A computer search
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
cites work: Triangle-free graphs with large chromatic numbers
cites work: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
cites work: An inequality for degree sequences
DOI: 10.1016/J.DISC.2014.08.010
description: scientific article; zbMATH DE number 6362907