Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
DOI10.1016/J.DISC.2014.10.004zbMATH Open1303.05062DBLPjournals/dm/HoppenKL15OpenAlexW2084962005WikidataQ101496286 ScholiaQ101496286MaRDI QIDQ472979FDOQ472979
Authors: Carlos Hoppen, Hanno Lefmann, Yoshiharu Kohayakawa 
Publication date: 20 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.004
Recommendations
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- A structural result for hypergraphs with many restricted edge colorings
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Title not available (Why is that?)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- Title not available (Why is that?)
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- On colourings of hypergraphs without monochromatic Fano planes
- Hypergraphs with many Kneser colorings
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- A structural result for hypergraphs with many restricted edge colorings
Cited In (16)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Hypergraphs with many Kneser colorings
- A structural result for hypergraphs with many restricted edge colorings
- Colourings without monochromatic disjoint pairs
- Avoiding and extending partial edge colorings of hypercubes
- Colouring set families without monochromatic \(k\)-chains
- Integer colorings with forbidden rainbow sums
- Title not available (Why is that?)
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- A coloring problem for intersecting vector spaces
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Colorations Extrêmes Dans Les Hypergraphes
This page was built for publication: Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472979)
