Extremal Graph Problems for Graphs with a Color-Critical Vertex

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

Source record

Source: Crossref

Published: Dec 1, 1993

DOI: 10.1017/s0963548300000833

Open original source ↗

Source abstract

In this paper we consider the following problem, given a graph H , what is the structure of a typical, i.e. random, H -free graph? We completely solve this problem for all graphs H containing a critical vertex. While this result subsumes a sequence of known results, its short proof is self contained.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.