Large cliques in hypergraphs with forbidden substructures (Q2226629)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7307768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large cliques in hypergraphs with forbidden substructures |
scientific article; zbMATH DE number 7307768 |
Statements
Large cliques in hypergraphs with forbidden substructures (English)
0 references
8 February 2021
0 references
A previous result from \textit{A. Gyárfás} et al. [Combinatorica 22, No. 2, 269--274 (2002; Zbl 0996.05094)] established a bound on the number of vertices in a complete subgraph that exists in a graph that does not contain a given induced subgraph with specified number of edges. The author suggests a new proof of this result that can be extended to \(k\)-uniform hypergraphs. The applications of the result related to the colorful and fractional versions of Helly's theorem are presented.
0 references
extremal graph theory
0 references
chromatic number
0 references
forbidden induced subgraph
0 references
0.9113945
0 references
0.91016984
0 references
0.9033366
0 references
0 references
0.8992457
0 references
0.8962267
0 references
0.8935549
0 references
0.8930492
0 references
0.8906145
0 references
