Extremal Graph Problems for Graphs with a Color-Critical Vertex

DOI10.1017/S0963548300000833zbMATH Open0793.05087MaRDI QIDQ4290097FDOQ4290097

Authors: Christoph Hundack, Hans Jürgen Prömel, Angelika Steger 

Publication date: 28 April 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Recommendations

• Excluding induced subgraphs: critical graphs
• Critical vertices and edges in \(H\)-free graphs
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Graphs with large maximum degree containing no edge-critical graphs
• On the number of edges in colour-critical graphs and hypergraphs

zbMATH Keywords

random graphchromatic numbercritical vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• An extremal graph problem
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• On the Structure of Edge Graphs
• Coloring Clique-free Graphs in Linear Expected Time
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Title not available (Why is that?)

Cited In (15)

• Discrete metric spaces: structure, enumeration, and 0-1 laws
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Critical vertices and edges in \(H\)-free graphs
• The typical structure of sparse \(K_{r+1}\)-free graphs
• On the typical structure of graphs not containing a fixed vertex-critical subgraph
• Title not available (Why is that?)
• On the probability of nonexistence in binomial subsets
• The number of graphs without forbidden subgraphs
• Extremal H‐Colorings of Graphs with Fixed Minimum Degree
• Excluding induced subgraphs: critical graphs
• Title not available (Why is that?)
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• Supersaturation problem for color-critical graphs
• A limit law of almost \(l\)-partite graphs

This page was built for publication: Extremal Graph Problems for Graphs with a Color-Critical Vertex

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