Decomposing Graphs into Edges and Triangles
From MaRDI portal
Publication:5222546
DOI10.1017/S0963548318000421zbMath1436.05086arXiv1710.08486MaRDI QIDQ5222546
Bernard Lidický, Taísa L. Martins, Yanitsa Pehova, Daniel Král'
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08486
Related Items (9)
Spectral radius and clique partitions of graphs ⋮ An overview of graph covering and partitioning ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Graph and hypergraph packing ⋮ Eigenvalues and clique partitions of graphs ⋮ Decomposing Graphs into Edges and Triangles ⋮ Sharp bounds for decomposing graphs into edges and triangles ⋮ Compactness and finite forcibility of graphons
Cites Work
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- A new lower bound based on Gromov's method of selecting heavily covered points
- Monochromatic triangles in three-coloured graphs
- A note on the inducibility of 4-vertex graphs
- A problem of Erdős on the minimum number of \(k\)-cliques
- Integer and fractional packings in dense graphs
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- Proof of a conjecture of Katona and Tarjan
- Greedy maximum-clique decompositions
- Quasirandom permutations are characterized by 4-point densities
- Rainbow triangles in three-colored graphs
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Non-Three-Colourable Common Graphs Exist
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
- Hypergraphs Do Jump
- A Solution to the 2/3 Conjecture
- On the Decomposition of Graphs
- The greedy clique decomposition of a graph
- A blow-up lemma for approximate decompositions
- Integer and fractional packing of families of graphs
- A New Bound for the 2/3 Conjecture
- Semidefinite Programming and Ramsey Numbers
- Decomposing Graphs into Edges and Triangles
- On the Density of Transitive Tournaments
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Limits of Order Types
- Flag algebras
- The Representation of a Graph by Set Intersections
- Counting flags in triangle-free digraphs
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
This page was built for publication: Decomposing Graphs into Edges and Triangles
