Some heterochromatic theorems for matroids

DOI10.1016/j.disc.2018.06.030zbMath1393.05122arXiv1708.08562OpenAlexW2962897074MaRDI QIDQ1660247

Criel Merino, Juan José Montellano-Ballesteros

Publication date: 15 August 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08562

zbMATH Keywords

hypergraphmatroidanti-Ramsey number

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
• An analogue of the Erdős-Stone theorem for finite geometries
• An anti-Ramsey theorem on cycles
• On the chromatic number of binary matroids
• On the minimum size of tight hypergraphs
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• An anti-Ramsey Theorem on edge-cutsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some heterochromatic theorems for matroids