Rainbow triangles in three-colored graphs
From MaRDI portal
Publication:2399351
DOI10.1016/j.jctb.2017.04.002zbMath1368.05043arXiv1408.5296OpenAlexW2605561794MaRDI QIDQ2399351
Publication date: 22 August 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5296
Related Items
Rainbow copies of \(C_4\) in edge-colored hypercubes, Maximum number of almost similar triangles in the plane, On a colored Turán problem of Diwan and Mubayi, Grünbaum colorings extended to non-facial 3-cycles, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, Semantic limits of dense combinatorial objects, On Turán numbers of the complete 4-graphs, Frustrated triangles, Rainbow triangles in arc-colored tournaments, Decomposing Graphs into Edges and Triangles, Closing in on Hill's Conjecture, Compactness and finite forcibility of graphons, Inducibility of directed paths, Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- Rainbow copies of \(C_4\) in edge-colored hypercubes
- The clique density theorem
- A new lower bound based on Gromov's method of selecting heavily covered points
- Turán \(H\)-densities for 3-graphs
- Monochromatic triangles in three-coloured graphs
- On the maximum number of five-cycles in a triangle-free graph
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- On the number of pentagons in triangle-free graphs
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
- Hypergraphs Do Jump
- The number of cliques in graphs of given order and size
- A Solution to the 2/3 Conjecture
- On the Minimal Density of Triangles in Graphs
- On the Maximum Induced Density of Directed Stars and Related Problems
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Flag algebras
- Counting flags in triangle-free digraphs
