Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs

DOI10.1002/jgt.22639zbMath1521.05119arXiv1903.09725OpenAlexW3097759965MaRDI QIDQ6055927

Maria A. Axenovich, Lea Weber, Casey Tompkins

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.09725

zbMATH Keywords

bipartiteforbidden induced subgraphshomogeneous setsErdős-Hajnal conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Pure pairs. IV: Trees in bipartite graphs ⋮ Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix ⋮ A bipartite version of the Erdős–McKay conjecture ⋮ Extremal bipartite independence number and balanced coloring ⋮ Bipartite Independence Number in Graphs with Bounded Maximum Degree ⋮ Large Homogeneous Submatrices

Cites Work

• Ramsey-type theorems
• The Erdős-Hajnal conjecture for paths and antipaths
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension
• The Erdös-Hajnal Conjecture-A Survey
• Asymptotic bounds for bipartite Ramsey numbers
• Unnamed Item

This page was built for publication: Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs