Distinct degrees and homogeneous sets
From MaRDI portal
Publication:2680569
DOI10.1016/j.jctb.2022.11.004OpenAlexW4311356121MaRDI QIDQ2680569
Publication date: 4 January 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.05932
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular subgraphs of almost regular graphs
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Erdős and Rényi conjecture
- Non-Ramsey graphs are \(c\log n\)-universal
- Dense graphs without 3-regular subgraphs
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Every graph contains a linearly sized induced subgraph with all degrees odd
- Ramsey graphs induce subgraphs of many different sizes
- On a Ramsey type theorem
- Recent developments in graph Ramsey theory
- Distinct degrees in induced subgraphs
- Large Nearly Regular Induced Subgraphs
- Cliques in random graphs
- Large Induced Subgraphs with All Degrees Odd
- Induced subgraphs of prescribed size
- Induced Subgraphs With Many Distinct Degrees
- On a Ramsey-type problem of Erdős and Pach
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- 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 lemma of Littlewood and Offord
This page was built for publication: Distinct degrees and homogeneous sets
