Large cliques in C₄-free graphs
From MaRDI portal
Publication:700383
DOI10.1007/S004930200012zbMATH Open0996.05094OpenAlexW1966724030MaRDI QIDQ700383FDOQ700383
Authors: András Gyárfás, Alice Hubenko, József Solymosi 
Publication date: 20 October 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200012
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (21)
- Loose vertices in \(C_{4}\)-free Berge graphs
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
- Efficient testing without efficient regularity
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
- Graphs with no induced \(K_{2,t}\)
- On graphs without a \(C_{4}\) or a diamond
- The large cliques in the graph of quadratic forms
- Large Topological Cliques in Graphs Without a 4-Cycle
- Induced Turán numbers
- Radon numbers and the fractional Helly theorem
- Cliques in the union of \(C_4\)-free graphs
- Large cliques in hypergraphs with forbidden substructures
- Large cliques or cocliques in hypergraphs with forbidden order-size pairs
- Almost all \(C_4\)-free graphs have fewer than \((1-\varepsilon)\,\text{ex}(n,C_4)\) edges
- Fractional Helly theorem for Cartesian products of convex sets
- Large P4‐free graphs with bounded degree
- Covering the cliques of a graph with vertices
- Title not available (Why is that?)
- Subdivisions of a large clique in \(C_6\)-free graphs
- On arrangements of orthogonal circles
- Cliques in \(C_4\)-free graphs of large minimum degree
This page was built for publication: Large cliques in \(C_4\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700383)
