Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
Authors:
- Carlos HoppenCHCarlos Hoppen
- Yoshiharu KohayakawaYKYoshiharu Kohayakawa
- Hanno LefmannHLHanno Lefmann
- 1 January 2014
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 35, 354-373
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear HypergraphsJournal of Graph Theory, 2012
- Hypergraphs with many Kneser coloringsEuropean Journal of Combinatorics, 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
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUESJournal of the London Mathematical Society, 2004
- Some intersection theorems for ordered sets and graphsJournal of Combinatorial Theory, Series A, 1986
- Path Ramsey numbers in multicoloringsJournal of Combinatorial Theory, Series B, 1975
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959
- On a problem of K. ZarankiewiczColloquium Mathematicum, 1954
- ber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen KoeffizientenMathematische Zeitschrift, 1923