On edges not in monochromatic copies of a fixed bipartite graph
From MaRDI portal
Publication:505918
DOI10.1016/j.jctb.2016.11.006zbMath1367.05077arXiv1605.09141OpenAlexW2963207566MaRDI QIDQ505918
Publication date: 26 January 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09141
Related Items
Extremal graphs for edge blow-up of graphs, Extremal graphs for odd wheels, Edges Not Covered by Monochromatic Bipartite Graph, Turán number for odd‐ballooning of trees, Edges not in any monochromatic copy of a fixed graph, Extremal problems and results related to Gallai-colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Monochromatic triangles in three-coloured graphs
- Clique covering of graphs
- Norm-graphs: Variations and applications
- Some recent problems and results in graph theory
- Graph products and monochromatic multiplicities
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Norm-graphs and bipartite Turán numbers
- Packing triangles in a graph and its complement
- On Sets of Acquaintances and Strangers at any Party
- Disjoint Color-Avoiding Triangles
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Edge disjoint monochromatic triangles in 2-colored graphs
