An extremal property of Turán graphs

zbMATH Open1204.05046MaRDI QIDQ612959FDOQ612959

Authors: Felix Lazebnik, Spencer Tofts 

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/232855

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An Extremal Property of Turán Graphs, II
• Maximum number of colorings of (2k, k²)‐graphs
• scientific article; zbMATH DE number 3970790
• Note on Turán's graph
• Another extremal problem for Turan graphs

zbMATH Keywords

proper vertex coloringTuran graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Cited In (13)

• Turán graphs and the number of colorings
• Turán theorems and convexity invariants for directed graphs
• The maximum number of colorings of graphs of given order and size: a survey
• A proof of Tomescu's graph coloring conjecture
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Maximizing proper colorings on graphs
• The maximal length of a gap between \(r\)-graph Turán densities
• The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings
• Every graph is eventually Turán-good
• An Extremal Property of Turán Graphs, II
• Maximum number of colorings of (2k, k²)‐graphs
• Turán type results for distance graphs
• Title not available (Why is that?)

This page was built for publication: An extremal property of Turán graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612959)