Cycle-connected graphs
type: Item
instance of: scholarly article
title: Cycle-connected graphs
zbMATH Open document ID: 0776.05057
DOI: 10.1016/0012-365X(92)90680-E
author: Richard A. Duke
author: Vojtěch Rödl
author: P. Erdős
published in: Discrete Mathematics
publication date: 1993-01-17T00:00:00Z
review text: A graph \(G\) is called \(K\)-connected, \(K\) a fixed collection of graphs, if every pair of edges of \(G\) is contained in a subgraph \(S\) of \(G\), where \(S\in K\). The authors discuss \(C_4\)-connected graphs, where \(C_4\) is a cycle of length four and compute the constant \(c''\) such that there exists a graph with \(cn^2\) edges \((n = |V(G)|)\) in which the largest \(C_4\)-connected subgraph has size at most \(c''\).
reviewed by: Michael Hager
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 97507
zbMATH Keywords: cycle-connected graphs
zbMATH Keywords: multipartite graphs
Wikidata QID: Q105742624
MaRDI profile type: Publication
cites work: Q3218156
cites work: Q3661614
cites work: Q3347917
cites work: The Erdős-Ko-Rado theorem for small families
cites work: Q3828027
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q5520566
cites work: Q4200109
full work available at URL: 0012-365x(92)90680-e
OpenAlex ID: W2025848774
description: scientific article; zbMATH DE number 97507