On the edge distribution in triangle-free graphs
From MaRDI portal
(Redirected from Publication:1892845)
Let \(G\) be a graph on \(n\) vertices. The author shows that if any subgraph of \(G\) induced by \(n/2\) vertices is of size at least \(n^ 2/36\) then \(G\) contains a triangle. Further, it is studied how much the edge distribution in a triangle-free graph deviates from the edge distribution in a typical random graph of the same order and size.
Recommendations
Cited in
(16)- Graphs without large triangle free subgraphs
- Triangle-free subgraphs of powers of cycles
- A local density condition for triangles
- The local density of triangle-free graphs
- For which densities are random triangle-free graphs almost surely bipartite?
- Sparse halves in triangle-free graphs
- Intersections of graphs
- More about sparse halves in triangle-free graphs
- Intersections of hypergraphs
- Sparse halves in dense triangle-free graphs
- Sparse halves in K4‐free graphs
- K4$K_4$‐free graphs have sparse halves
- Edge distribution and density in the characteristic sequence
- No dense subgraphs appear in the triangle-free graph process
- 10 problems for partitions of triangle-free graphs
- Making a K₄-free graph bipartite
This page was built for publication: On the edge distribution in triangle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892845)
