Regular subgraphs at every density
From MaRDI portal
Cites work
- Coding for Sunflowers
- Dense graphs without 3-regular subgraphs
- Edge-disjoint cycles with the same vertex set
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Graph theory with applications
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3505014 (Why is no real title available?)
- scientific article; zbMATH DE number 3333193 (Why is no real title available?)
- Improved bounds for the sunflower lemma
- Intersection Theorems for Systems of Sets
- Maximum hypergraphs without regular subgraphs
- More on the extremal number of subdivisions
- Nearly-linear monotone paths in edge-ordered graphs
- Note on regular subgraphs
- Note on sunflowers
- On even-degree subgraphs of linear hypergraphs
- On the combinatorial problems which I would most like to see solved
- Regular subgraphs of almost regular graphs
- Regular subgraphs of dense graphs
- Regular subgraphs of linear hypergraphs
- Regular subgraphs of random graphs
- Regular subgraphs of uniform hypergraphs
- Resolution of the Erdős–Sauer problem on regular subgraphs
- The probabilistic method
- Thresholds versus fractional expectation-thresholds
- Turán numbers of subdivided graphs
- Two-regular subgraphs of hypergraphs
- Two-regular subgraphs of odd-uniform hypergraphs
This page was built for publication: Regular subgraphs at every density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391455)