Dense graphs without 3-regular subgraphs
From MaRDI portal
Recommendations
Cited in
(29)- Distinct degrees and homogeneous sets
- Small dense subgraphs of a graph
- Regular subgraphs of uniform hypergraphs
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Largest 2-regular subgraphs in 3-regular graphs
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- Hypergraph containers
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Spectrally degenerate graphs: hereditary case
- On graph decompositions modulo \(k\)
- \(C_4\)-free subgraphs with large average degree
- Vertex partitions by connected monochromatic \(k\)-regular graphs
- Regular subgraphs of dense graphs
- Resolution of the Erdős–Sauer problem on regular subgraphs
- How to build a pillar: a proof of Thomassen's conjecture
- Two-regular subgraphs of odd-uniform hypergraphs
- A note on degenerate and spectrally degenerate graphs
- Nearly-linear monotone paths in edge-ordered graphs
- scientific article; zbMATH DE number 4152412 (Why is no real title available?)
- scientific article; zbMATH DE number 1190654 (Why is no real title available?)
- Graphs without a partition into two proportionally dense subgraphs
- Maximum hypergraphs without regular subgraphs
- Problems and results in extremal combinatorics. II
- Triangle-free subgraphs with large fractional chromatic number
- On a conjecture of Thomassen concerning subgraphs of large girth
- On even-degree subgraphs of linear hypergraphs
- A note on Thomassen's conjecture
- Dense Induced Subgraphs of Dense Bipartite Graphs
- Note on regular subgraphs
This page was built for publication: Dense graphs without 3-regular subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892830)
