Frustrated triangles
From MaRDI portal
Publication:2515578
DOI10.1016/j.disc.2015.06.006zbMath1318.05019arXiv1411.1749OpenAlexW2914893875MaRDI QIDQ2515578
Gábor Mészáros, Teeradej Kittipassorn
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1749
Related Items (4)
Negative (and positive) circles in signed graphs: a problem collection ⋮ Negative circles in signed graphs: a problem collection ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ The dimension of the negative cycle vectors of a signed graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monochromatic triangles in three-coloured graphs
- On a theorem of Rademacher-Turán
- Rainbow triangles in three-colored graphs
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
- Universality of Graphs with Few Triangles and Anti-Triangles
- A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
- Triangles in an Ordinary Graph
This page was built for publication: Frustrated triangles