A survey of degree-boundedness
From MaRDI portal
Cites work
- \(C_4\)-free subgraphs with large average degree
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A Conceptual Breakthrough in Sphere Packing
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
- A Menger-type theorem for two induced paths
- A new perspective on FO model checking of dense graph classes
- A note on Ramsey numbers
- A note on Thomassen's conjecture
- A semi-algebraic version of Zarankiewicz's problem
- A Separator Theorem for Planar Graphs
- A separator theorem for string graphs and its applications
- A survey of -boundedness
- An incidence theorem in higher dimensions
- Applications of a new separator theorem for string graphs
- Approximating clique-width and branch-width
- Approximation algorithms for polynomial-expansion and low-density graphs
- Bounded twin-width graphs are polynomially -bounded
- Branch-depth: generalizing tree-depth of graphs
- Chromatic number of ordered graphs with forbidden ordered subgraphs
- Circle graph obstructions
- Circle graph obstructions under pivoting
- Circle graphs are quadratically χ‐bounded
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Coloring polygon visibility graphs and their generalizations
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
- Colouring arcwise connected sets in the plane. I
- Combinatorial optimization. Packing and covering
- Covering and coloring polygon-circle graphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Dense graphs without 3-regular subgraphs
- Dense induced bipartite subgraphs in triangle-free graphs
- Dense Induced Subgraphs of Dense Bipartite Graphs
- Dynamic concentration of the triangle‐free process
- Every graph of sufficiently large average degree contains a C₄-free subgraph of large average degree
- Expander spanning subgraphs with large girth
- Extremal problems in discrete geometry
- First-order interpretations of bounded expansion classes
- Geometric separator theorems and applications
- Girth in graphs
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graph searching and a min-max theorem for tree-width
- Graph Theory and Probability
- Graphs of bounded cliquewidth are polynomially -bounded
- Graphs of bounded twin-width are quasi-polynomially -bounded
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- Hasse diagrams with large chromatic number
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 1002021 (Why is no real title available?)
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- scientific article; zbMATH DE number 7581723 (Why is no real title available?)
- scientific article; zbMATH DE number 3893229 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3323729 (Why is no real title available?)
- scientific article; zbMATH DE number 3333193 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- Improved bounds for colouring circle graphs
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Induced subdivisions and bounded expansion
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Induced subgraph density. I: A loglog step towards Erdős-Hajnal
- Induced subgraphs of graphs with large chromatic number. III: Long holes
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
- Induced subgraphs of graphs with large chromatic number. VI. Banana trees
- Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
- Induced subgraphs of induced subgraphs of large chromatic number
- Induced subtrees in graphs of large chromatic number
- Induced Turán numbers
- Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Kővári-Sós-Turán theorem for hereditary families
- Local complementation and interlacement graphs
- Mim-width. I. Induced path problems
- Minor-matching hypertree width
- Near-optimal separators in string graphs
- On a conjecture of Thomassen concerning subgraphs of large girth
- On a problem of K. Zarankiewicz
- On bounding the chromatic number of L-graphs
- On finite set-systems whose every intersection is a kernel of a star
- On the chromatic number of multiple interval graphs and overlap graphs
- On the Chromatic Number of Subgraphs of a Given Graph
- On the density of families of sets
- On the Zarankiewicz problem for graphs with bounded VC-dimension
- Perfect Elimination and Chordal Bipartite Graphs
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Polynomial bounds for chromatic number. III. Excluding a double star
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Proceedings of the 64th annual IEEE symposium on foundations of computer science, FOCS 2023, Santa Cruz, CA, USA, November 6--9, 2023
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Radius two trees specify χ‐bounded classes
- Ramsey-type theorems
- Representations of Planar Graphs
- Resolution of the Erdős–Sauer problem on regular subgraphs
- Restricted frame graphs and a conjecture of Scott
- Separating polynomial \(\chi\)-boundedness from \(\chi\)-boundedness
- Separation choosability and dense bipartite induced subgraphs
- Separators for sphere-packings and nearest neighbor graphs
- Separators in region intersection graphs
- Stable graphs of bounded twin-width
- String graphs and incomparability graphs
- String graphs and separators
- String graphs. II: Recognizing string graphs is NP-hard
- Strongly sublinear separators and polynomial expansion
- Sublinear separators in intersection graphs of convex shapes
- The -Ramsey problem for triangle-free graphs
- The \(\varepsilon\)-\(t\)-net problem
- The Erdős-Hajnal conjecture. A survey
- The grid theorem for vertex-minors
- The polynomial method over varieties
- The strong perfect graph theorem
- The triangle-free process and the Ramsey number \(R(3,k)\)
- Treewidth versus clique number. II: Tree-independence number
- Triangle-free intersection graphs of line segments with large chromatic number
- Turán-type results for intersection graphs of boxes
- Twin-width II: small classes
- Twin-width. III: Max independent set, min dominating set, and coloring
- Twin-width. VIII: Delineation and win-wins
- Vertex-minor-closed classes are -bounded
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
- Zarankiewicz's problem for semilinear hypergraphs
- Zarankiewicz's problem via -t-nets
This page was built for publication: A survey of degree-boundedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945771)
