Extremal Graph Problems for Graphs with a Color-Critical Vertex

DOI10.1017/S0963548300000833zbMath0793.05087MaRDI QIDQ4290097

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

Publication date: 28 April 1994

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

zbMATH Keywords

chromatic numberrandom graphcritical vertex

Mathematics Subject Classification ID

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

Related Items (8)

Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ On the probability of nonexistence in binomial subsets ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ The number of graphs without forbidden subgraphs ⋮ A Limit Law of Almost l-partite Graphs

Cites Work

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

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