A bipartite version of the Erdős–McKay conjecture
From MaRDI portal
Publication:6091053
DOI10.1017/s0963548322000347zbMath1527.05169arXiv2207.12874OpenAlexW4311981020WikidataQ123286832 ScholiaQ123286832MaRDI QIDQ6091053
Publication date: 23 November 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.12874
Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Erdős and Rényi conjecture
- The multiplication table problem for bipartite graphs
- Non-Ramsey graphs are \(c\log n\)-universal
- Graphs with a small number of distinct induced subgraphs
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Blowup Ramsey numbers
- Ramsey graphs induce subgraphs of many different sizes
- On a Ramsey type theorem
- Distinct degrees and homogeneous sets
- Distinct degrees in induced subgraphs
- 3‐Color bipartite Ramsey number of cycles and paths
- A new upper bound for the bipartite Ramsey problem
- On Subgraph Sizes in Random Graphs
- Markov Chains
- Induced subgraphs of prescribed size
- Induced Subgraphs With Many Distinct Degrees
- Long arithmetic progressions in sum-sets and the number x-sum-free sets
- Bipartite Independence Number in Graphs with Bounded Maximum Degree
- Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Some remarks on the theory of graphs
- On a problem of K. Zarankiewicz
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- On subgraphs with degrees of prescribed residues in the random graph
