Counting sparse induced subgraphs in locally dense graphs

DOI10.1016/J.EJC.2025.104125MaRDI QIDQ7006229zbMATH OpenFDO

Authors Rajko Nenadov

Publication date 31 March 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104125

zbMATH Keywords

Erdős-Rogers functionindependent sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Cites work

• \(K_4\)-free graphs without large induced triangle-free subgraphs
• Counting independent sets in graphs
• Estimation of the number of connected sets in a graph and the structure of components of random subsets
• Hypergraph containers
• Improved bounds for the Erdős-Rogers (s, s+2)-problem
• Improved bounds for the Erdős-Rogers function
• Independent sets in hypergraphs
• On generalized Ramsey numbers of Erdős and Rogers
• On sets of integers containing k elements in arithmetic progression
• On the maximum F-free induced subgraphs in K_t-free graphs
• On the number of graphs without 4-cycles
• The asymptotics of r(4,t)
• The Construction of Certain Graphs
• The method of hypergraph containers

This page was built for publication: Counting sparse induced subgraphs in locally dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006229)