Bipartite Independence Number in Graphs with Bounded Maximum Degree
DOI10.1137/20M1321760zbMath1465.05123arXiv2002.10930OpenAlexW3008199904MaRDI QIDQ4992836
Lea Weber, Jean-Sébastien Sereni, Richard Snyder, Maria A. Axenovich
Publication date: 10 June 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.10930
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey-type theorems
- On finite Ramsey numbers
- Norm-graphs: Variations and applications
- (0, 1)-matrices with no half-half submatrix of ones
- Short cycles in random regular graphs
- Independent sets in regular graphs
- New results on the Zarankiewicz problem
- The Erdös-Hajnal Conjecture-A Survey
- Balanced coloring of bipartite graphs
- Teilweise Lösung eines verallgemeinerten Problems von K. Zarankiewicz
- Über ein Problem von K. Zarankiewicz
- The Independence Ratio of Regular Graphs
- A bipartite Ramsey problem and the Zarankiewicz numbers
- Extremal graphs with bounded densities of small subgraphs
- An Upper Bound on Zarankiewicz' Problem
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Large Homogeneous Submatrices
- Asymptotic bounds for bipartite Ramsey numbers
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
This page was built for publication: Bipartite Independence Number in Graphs with Bounded Maximum Degree
