Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Equivalent subsets of a colored set

From MaRDI portal
Publication:942148
Jump to:navigation, search

DOI10.1016/j.ejc.2006.06.025zbMath1151.05049OpenAlexW2091733565MaRDI QIDQ942148

Tomoki Nakamigawa

Publication date: 4 September 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.025


zbMATH Keywords

partitionRamsey theory


Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Ramsey theory (05D10)


Related Items (2)

An extremal problem for vertex partition of complete multipartite graphs ⋮ Vertex partition of a complete multipartite graph into two kinds of induced subgraphs




Cites Work

  • A partition problem on colored sets
  • On Representatives of Subsets




This page was built for publication: Equivalent subsets of a colored set

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:942148&oldid=12915942"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki