Cycle-connected graphs (Q1201258): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105742624, #quickstatements; #temporary_batch_1707149277123 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3218156 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3661614 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3347917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Erdős-Ko-Rado theorem for small families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3828027 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5520566 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4200109 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90680-e / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2025848774 / rank | |||
Normal rank |
Latest revision as of 08:25, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cycle-connected graphs |
scientific article |
Statements
Cycle-connected graphs (English)
0 references
17 January 1993
0 references
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''\).
0 references
cycle-connected graphs
0 references
multipartite graphs
0 references