On colorful edge triples in edge-colored complete graphs
From MaRDI portal
Publication:2657036
DOI10.1007/s00373-020-02214-4zbMath1459.05204arXiv1812.06706OpenAlexW3086816339MaRDI QIDQ2657036
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.06706
Generalized Ramsey theory (05C55) Triple systems (05B07) Coding theorems (Shannon theory) (94A24) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orientations making \(k\)-cycles cyclic
- An explicit construction for a Ramsey problem
- Kneser's conjecture, chromatic number, and homotopy
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- New bounds for perfect hashing via information theory
- A survey of Kirkman triple systems and related designs
- Qualitative independence and Sperner problems for directed graphs
- Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
- A variant of the classical Ramsey problem
- On generalized Ramsey theory: The bipartite case
- Anti-Ramsey colorings in several rounds
- Constructive lower bounds on classical multicolor Ramsey numbers
- Hall ratio of the Mycielski graphs
- Ramsey bounds for graph products
- On resolvable designs
- String Quartets in Binary
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Separating Partition Systems and Locally Different Sequences
- Fredman–Komlós bounds and information theory
- Zero error capacity under list decoding
- On the Shannon capacity of a graph
- A nontrivial lower bound on the shannon capacities of the complements of odd cycles
- Repeated communication and Ramsey graphs
- Sur le coloriage des graphs
- I. Schur, C. E. Shannon and Ramsey numbers, a short story
This page was built for publication: On colorful edge triples in edge-colored complete graphs
