The edge-coloring of complete hypergraphs. I (Q1260045): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(79)90002-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1992519511
@@ Property / OpenAlex ID: W1992519511 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236252
@@ Property / cites work: Q3236252 / rank @@
+Normal rank
@@ Property / cites work @@
+On separating systems of a finite set
@@ Property / cites work: On separating systems of a finite set / rank @@
+Normal rank
@@ Property / cites work @@
+Q4073396
@@ Property / cites work: Q4073396 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof of the Erdős-Chao Ko-Rado theorem
@@ Property / cites work: A simple proof of the Erdős-Chao Ko-Rado theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A finite set covering theorem
@@ Property / cites work: A finite set covering theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic Numbers for Certain Graphs
@@ Property / cites work: Chromatic Numbers for Certain Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5181380
@@ Property / cites work: Q5181380 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flows, Minimum Coverings, and the Four-Color Conjectures
+Normal rank
@@ Property / cites work @@
+On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
+Normal rank
@@ Property / cites work @@
+Q4108334
@@ Property / cites work: Q4108334 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1260045