Edge-colorings avoiding a fixed matching with a prescribed color pattern
- 1 July 2015
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 47, 75-94
Abstract
No abstract availableFunding Information
- CAPES (408/13)
- DAAD (56267227)
- CNPq (448754/2014-2, 304510/2012-2)
- FAPESP (2013/03447-6)
This publication has 9 references indexed in Scilit:
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán numberEuropean Journal of Combinatorics, 2014
- Hypergraphs with many Kneser coloringsEuropean Journal of Combinatorics, 2012
- The maximum number of K 3 -free and K 4 -free edge 4-coloringsJournal of the London Mathematical Society, 2012
- Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given SizeCombinatorics, Probability and Computing, 2012
- On Colourings of Hypergraphs Without Monochromatic Fano PlanesCombinatorics, Probability and Computing, 2009
- A remark on the number of edge colorings of graphsEuropean Journal of Combinatorics, 2006
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUESJournal of the London Mathematical Society, 2004
- The number of edge colorings with no monochromatic triangleJournal of Graph Theory, 1996
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959