maths.free › Combinatorics & Graph Theory › Partially Ordered Sets › Discussion

Discussion

Over coffee, Bob said that he really liked this chapter. This material was full of cases of very concrete procedures for doing useful things. I like that.

Discussion

Over coffee, Bob said that he really liked this chapter. This material was full of cases of very concrete procedures for doing useful things. I like that. Yolanda offered a somewhat different perspective On the other hand, this last procedure only seems to work with interval orders and we still don't have a clue as to how to find the width of a poset in the general case. This might be very difficultlike the graph coloring problems discussed in the last chapter. Dave weighed in with Somehow I think there's going to be a fairly efficient process that works for all posets. We may not have all the tools yet, but let's wait a bit.

Not much was said for a while and after a pause, Carlos ventured that there were probably a lot of combinatorial problems for posets that had analogous versions for graphs and in those cases, the poset version would be a bit more complicated, sometime a little bit and sometimes a very big bit. Zori was quiet but she was thinking. These poset structures might even be useful, as she could imagine many settings in which a linear order was impossible or impractical. Maybe there were ways here to earn a few dollars.

ឥឡូវ​អ្នក គ្មាន​ម៉ាស៊ីន​គិតលេខ​ដែល​អាច​ដោះស្រាយ​បញ្ហា​នេះ​បាន​ទេ ប៉ុន្តែ​វា​អាច​គណនា​បាន​ ។ ព្យាយាម​មួយ​ខាង​ក្រោម ឬ​វាយ​របស់​អ្នក​ផ្ទាល់ ។

រក្សា​ការ​ធ្វើការ​របស់​អ្នក​ផ្ទាល់

គណនី​ឥត​គិត​ថ្លៃ​បន្ថែម​ចំណាំ​លើ​មេរៀន​នីមួយៗ កំណត់​ហេតុ​នៃ​អ្វី​ដែល​អ្នក​បាន​បញ្ចប់ បញ្ហា​ដែល​អ្នក​បាន​ដោះស្រាយ​នៅ​កន្លែង​មួយ និង​គ្រូ​ដែល​អ្នក​អាច​សួរ​អំពី​ទំព័រ​នេះ ។ គណិតវិទ្យា​ដោយ​ខ្លួន​វា​គឺ​បើក​ចំហ​សម្រាប់​អ្នក​ទាំងអស់​គ្នា ចុះឈ្មោះ​ចូល ឬ​មិន​ចុះឈ្មោះ​ចូល ។

ចុះឈ្មោះ ចូល

និមិត្ត​សញ្ញា​ដែល​បាន​ប្រើ​នៅ​ទីនេះ

ចុច​និមិត្ត​សញ្ញា​ណាមួយ​សម្រាប់​ការ​កំណត់​ពេញលេញ រូបភាព និង​តួអក្សរ​នីមួយៗ​មាន​ន័យ​អ្វី ។

សំណួរ​ដែល​មនុស្ស​សួរ

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

ផ្នែក​នៃ​ទំព័រ​នេះ​ត្រូវ​បាន​កែប្រែ​ពី Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). បន្សំ​និង​ពន្យល់​នៅ​ទីនេះ​ឡើងវិញ កំហុស​គឺ​របស់​យើង ។

បន្ថែម​ទៀត​ក្នុង Combinatorics & Graph Theory