MAT4323 - Revision history

Jose.iovino: /* Catalog entry */

2025-01-21T21:53:37Z

Catalog entry

2025-01-21T21:50:45Z

2023-04-21T15:49:15Z

Topics List

2023-04-21T15:48:59Z

2023-04-21T15:47:15Z

2023-04-21T15:46:11Z

2023-04-21T15:42:20Z

Catalog entry

2023-04-21T15:38:13Z

2023-04-21T15:34:38Z

2023-04-21T15:21:13Z

@@ Line 1: / Line 1: @@
 == Catalog entry ==
-''Prerequisite'': Algebra and Number Systems [[MAT1313]], or Discrete Mathematical Structures (CS 2233/2231), or instructor consent.
+''Prerequisite'': Algebra and Number Systems [[MAT1313]], or Discrete Mathematical Structures (CS 2233/2231), or instructor consent. (3-0) 3 Credit Hours.
 ''Contents''

@@ Line 1: / Line 1: @@
 == Catalog entry ==
-''Prerequisite'': Algebra and Number Systems (MAT 1313), or Discrete Mathematical Structures (CS 2233/2231), or instructor consent.
+''Prerequisite'': Algebra and Number Systems [[MAT1313]], or Discrete Mathematical Structures (CS 2233/2231), or instructor consent.
 ''Contents''

@@ Line 53: / Line 53: @@
 |-
 | 13-14
-|| [[Finding order within Chaos]]
+|| [[Finding order within chaos]]
 ||
 || Ramsey's Theorem and Ramsey numbers
 |}

@@ Line 47: / Line 47: @@
 || Search trees, spanning trees, the Traveling Salesman Problem
 |-
-|  10-14
+|  10-12
 || [[Network algorithms]]
 || 4.1-4.5
 || Shortest path , minimum spanning trees, matching algorithms, transportation problems.
 |-
 ||
 || Ramsey's Theorem and Ramsey numbers
 |}

@@ Line 47: / Line 47: @@
 || Search trees, spanning trees, the Traveling Salesman Problem
 |-
-|  10-12
+|  10-14
 || [[Network algorithms]]
 || 4.1-4.5
 || Shortest path , minimum spanning trees, matching algorithms, transportation problems.
 |-
 ||
 || Ramsey's Theorem and Ramsey numbers
 |}

@@ Line 31: / Line 31: @@
 {| class="wikitable sortable"
 ! Week !! Topic !! Sections from Tucker's book !! Subtopics !! Prerequisite
 |-
 |  1-3
@@ Line 64: / Line 53: @@
 |  13-14
 || [[Network algorithms]]
 ||
 || Ramsey's Theorem and Ramsey numbers
 |}

@@ Line 4: / Line 4: @@
 ''Contents''
-(1) Graph models: Isomorphisms, edge counting, planar graphs.
-(2) Covering circuits and graph colorings: Euler circuits, Hamilton circuits, graph colorings.
+Graph models (Isomorphisms, edge counting, planar graphs),
-(3) Network algorithms: Shortest path, minimum spanning trees, matching algorithms, transportation problems.
+Covering circuits and graph colorings (Euler circuits, Hamilton circuits, graph colorings),
-(4) Ramsey's Theorem and Ramsey numbers.
+Network algorithms (Shortest path, minimum spanning trees, matching algorithms, transportation problems),
 == Sample textbooks ==

@@ Line 4: / Line 4: @@
 ''Contents''
-(1) Basic counting principles: Permutations, combinations, binomial coefficients, arrangements with repetitions, and the Inclusion-Exclusion principle.
+(1) Graph models: Isomorphisms, edge counting, planar graphs.
-(2) Graph models: Isomorphisms, edge counting
+(2) Covering circuits and graph colorings: Euler circuits, Hamilton circuits, graph colorings, Ramsey's theorem
-(3) Planar graphs.
+(3) Network algorithms: Shortest path, minimum spanning trees, matching algorithms, transportation problems.
-(4) Covering circuits and graph colorings: Euler circuits, Hamilton circuits, graph colorings, Ramsey's theorem
+(4) Ramsey's Theorem and Ramsey numbers.
 == Sample textbooks ==
@@ Line 42: / Line 40: @@
 || Counting with Venn diagrams.
 |-
-|  4-6
+|  1-3
 || [[Graph models]]
 || 12.1-12.3
 || Isomorphism, edge counting, planar graphs.
 |-
-|  7-8
+|  4-6
 || [[Covering circuits]]
 || 2.1-2.4
 || Euler circuits, Hamilton circuits, graph colorings, coloring theorems.
 |-
-|  9-10
+|  8-9
 || [[Trees]]
 || 3.1-3.4
 || Search trees, spanning trees, the Traveling Salesman Problem
 |-
-|  11-13
+|  10-12
 || [[Network algorithms]]
 || 4.1-4.5
 || Shortest path , minimum spanning trees, matching algorithms, transportation problems.
 |}

@@ Line 9: / Line 9: @@
 (4) Covering circuits and graph colorings: Euler circuits, Hamilton circuits, graph colorings, Ramsey's theorem
 (5) Network algorithms: Shortest path, minimum spanning trees, matching algorithms, transportation problems.
-(6) Order relations: Partially ordered sets, totally ordered sets, extreme elements (maximum, minimum, maximal and minimal elements), well-ordered sets, maximality principles.
+(6) Graph Colorings and Ramsey's Theorem.
 == Sample textbooks ==