Graphs with large maximum degree containing no edge-critical graphs

DOI10.1016/J.EJC.2022.103576MaRDI QIDQ2674560zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 14 September 2022

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2022.103576

zbMATH Keywords

chromatic numberTurán number

Mathematics Subject Classification ID

Vertex degrees (05C07) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Recommendations

• On the number of edges in colour-critical graphs and hypergraphs
• On complete subgraphs of color-critical graphs
• An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
• The average degree of an edge-chromatic critical graph
• The independence number of an edge-chromatic critical graph

Cites work

• Counting substructures. I: Color critical graphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Graphs with large maximum degree containing no odd cycles of a given length
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3258858 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Minimum \(H\)-decompositions of graphs: edge-critical case
• On the number of edges not covered by monochromatic copies of a fixed graph.
• On the structure of linear graphs
• Supersaturation problem for color-critical graphs
• The history of degenerate (bipartite) extremal graph problems

Cited in

(3)

• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Spectral extremal problem on disjoint color-critical graphs
• The general position number under vertex and edge removal

This page was built for publication: Graphs with large maximum degree containing no edge-critical graphs

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