On degree sums of a triangle-free graph

DOI10.1016/j.disc.2014.08.010zbMath1301.05072MaRDI QIDQ465274

Jochen Harant, Steffi Naumann, Stephan Brandt

Publication date: 31 October 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.010

zbMATH Keywords

chromatic number; degree sum; triangle-free graph

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C07: Vertex degrees

Related Items

Maximizing the degree powers of graphs with fixed size, Upper bound on the sum of powers of the degrees of graphs with few crossings per edge, Questions on color-critical subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Ramsey numbers
• An inequality for degree sequences
• An upper bound on the sum of squares of degrees in a hypergraph
• An upper bound on the sum of squares of degrees in a graph
• A 4-colour problem for dense triangle-free graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Maximizing the sum of the squares of the degrees of a graph
• Triangle-free graphs with large chromatic numbers
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Sums of powers of the degrees of a graph
• Upper bounds on the sum of powers of the degrees of a simple planar graph
• Small graphs with chromatic number 5: A computer search
• The Ramsey number R(3, t) has order of magnitude t²/log t
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph