Triangle-Free Graphs with Large Degree
From MaRDI portal
Recommendations
- Triangle-Free Graphs with High Minimal Degrees
- On the structure of triangle-free graphs of large minimum degree
- Triangle-free graphs with large chromatic numbers
- Maximal triangle‐free graphs with restrictions on the degrees
- Graphs without large triangle free subgraphs
- Triangle-free graphs with large independent domination number
- scientific article; zbMATH DE number 5917767
- On maximal triangle‐free graphs
- scientific article; zbMATH DE number 1208712
- On degree sums of a triangle-free graph
Cited in
(18)- Degree sequences in triangle-free graphs
- Another infinite sequence of dense triangle-free graphs
- A 4-colour problem for dense triangle-free graphs
- There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
- Triangle-free four-chromatic graphs
- Triangle-free graphs with large independent domination number
- The chromatic profile of locally bipartite graphs
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
- Dense graphs with small clique number
- On the Structure of Dense Triangle-Free Graphs
- Sparse halves in dense triangle-free graphs
- The chromatic profile of locally colourable graphs
- The minimum degree removal lemma thresholds
- Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon
- The minimum degree removal lemma thresholds (extended abstract)
- A criterion for Andrásfai-Erdős-Sós type theorems and applications
- On the structure of triangle-free graphs of large minimum degree
- The binding number of a graph and its cliques
This page was built for publication: Triangle-Free Graphs with Large Degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372989)
