Induced Turán problem in bipartite graphs
type: Item
instance of: scholarly article
title: Induced Turán problem in bipartite graphs
author: Maria Axenovich
author: Jakob Zimmermann
published in: Discrete Applied Mathematics
publication date: 2024-12-04T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 7953899
zbMATH Keywords: extremal function for a graph
zbMATH Keywords: VC dimension
zbMATH Keywords: bounded degree
MaRDI profile type: Publication
cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
cites work: Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
cites work: Phase transitions in Ramsey-Turán theory
cites work: Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
cites work: More on the extremal number of subdivisions
cites work: On the Extremal Number of Subdivisions
cites work: Ramsey-type theorems
cites work: Q4525053
cites work: Q5567712
cites work: Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle
cites work: A semi-algebraic version of Zarankiewicz's problem
cites work: Erdos-Hajnal conjecture for graphs with bounded VC-dimension
cites work: On a Turán type problem of Erdős
cites work: New asymptotics for bipartite Turán numbers
cites work: The History of Degenerate (Bipartite) Extremal Graph Problems
cites work: Hypergraph regularity and the multidimensional Szemerédi theorem
cites work: Graphs with no induced \(K_{2,t}\)
cites work: Improved bounds for the extremal number of subdivisions
cites work: On the Zarankiewicz problem for graphs with bounded VC-dimension
cites work: Turán Numbers of Subdivided Graphs
cites work: On a problem of K. Zarankiewicz
cites work: Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
cites work: Induced Turán Numbers
cites work: Dense Induced Subgraphs of Dense Bipartite Graphs
cites work: The counting lemma for regular k‐uniform hypergraphs
cites work: Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
cites work: Ramsey-Turán theory
cites work: Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1016/J.DAM.2024.10.007
description: scientific article; zbMATH DE number 7953899