- FRACTIONAL COLORINGS AND THE MYCIELSKI GRAPHS
- The Friendship Dr. John S. Caughman
- Introduction to Line Graphs Emphasizing their construction, clique
- Math 4/556 -SPRING 2011 SCHEDULE Mon/Wed MONDAY TUESDAY WEDNESDAY THURSDAY FRIDAY
- A Questionable Distance-Regular Graph Rebecca Ross
- Algebra of the 2x2x2 Rubik's Cube Under the direction of Dr. John S. Caughman
- GOLDEN ROOTS OF CHROMATIC POLYNOMIALS
- The Problem of the 36 Officers Kalei Titcomb
- The Structure of Maximum Independent Sets in Fullerenes
- Math 456/556 -Midterm Exam I -Solutions 1. (Part A) The characteristic equation x2
- Hamiltonicity and Fault Tolerance in the k-ary n-cube
- PRACTICE PROBLEMS MTH 4/556 EXAM TWO 1. How many partitions are there of a set with 8 elements?
- ALTERNATING SIGN MATRICES AND SYMMETRY Nickolas Chura
- SPIN MODELS AND BOSE-MESNER Nadine Wol
- Determinants of Distance Matrices of Trees Valerie Tillia
- ENUMERATING CYCLIC QUASIPLATONIC GROUPS FOR A GIVEN SIGNATURE
- Enumerating Cyclic Quasiplatonic Groups For a Given Signature
- 1 Introduction 1 2 Terminology of Partitions 1
- The Independence Fractal of a Graph Louis Kaskowitz
- Destroying Automorphisms in Trees Nathan H. Lazar
- "The Friendship Theorem and Projective Planes" December 7, 2005
- The Hamming Codes and Delsarte's Linear Programming Bound
- The Golden Root of Chromatic Polynomials 501: Mathematical Research and Literature
- Fibonacci Solitaire and Its Use in the Cliff F. Smith
- THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN CARLY VOLLET
- Portland State University Math 252 Calculus II
- First Day Review Worksheet Instructions: Work on this TOGETHER be sure everyone is contributing to the group.
- Construction of a set of n-1 MOLS from a projective plane of order n Given the 21 lines of a projective plane of order 4
- Portland State University Department of Mathematics & Statistics
- Deterministic Primality Testing in Polynomial A. Gabriel W. Daleson
- PRACTICE PROBLEMS MTH 4/556 EXAM TWO 1. How many partitions are there of a set with 8 elements?
- Topics in Combinatorics MTH 4/556, Spring 2011, Section 1
- Logic Overview, I MTH 356, Discrete Math
- Explorations in Recursion with John Pell and the Pell Sequence
- Math 344 -Second Exam (65 Minutes) Instructor: John Caughman -Thursday, July 28, 2011
- Sharp Upper Bounds for Largest Eigenvalue of the Laplacian Matrices of Tree
- @ 5",ppO c;L It~~ 0...../ :;]'1,bl:~ r..,;t~ qJ-l~bH=rrP. 4J x be.. ""Y. i:l-+ o-f tll-J. IJr;kit='t:l h (;,r So>e J. '"fl.
- Math 344 -(revised) SUMMER 2011 SCHEDULE Mon/Tues/Wed/Thurs WEEK MONDAY TUESDAY WEDNESDAY THURSDAY FRIDAY
- Discrete Mathematics MTH 356, Summer 2011, Section 1
- GRAPHIC REALIZATIONS OF SEQUENCES JOSEPH RICHARDS
- Math 344 -SUMMER 2011 SCHEDULE Mon/Tues/Wed/Thurs WEEK MONDAY TUESDAY WEDNESDAY THURSDAY FRIDAY
- Sharp Upper Bounds for Largest Eigenvalue of the Laplacian Matrices of Tree 1 / 34 Sharp Upper Bounds for Largest Eigenvalue of the Laplacian
- Math 356 -Second Exam Professor: John Caughman -Thursday, July 28, 2011
- Math 356 -Review for Final I. How many nonnegative integer solutions are there to the following?
- Fractional Colorings and Zykov Products of graphs
- Math 356 Review for Exam 2 1. Thirty buses hold 2000 passengers. Each bus has 80 seats. Assume 1 seat per passenger.
- Introduction to Group Theory Summer 2011, Course 344, Section 1
- Math 344 Review for Exam 2 1. Let H=Z(D10) denote the center of the dihedral group D10. Determine all of the left cosets
- Math 356 -SUMMER 2011 SCHEDULE Mon/Tues/Wed/Thurs WEEK MONDAY TUESDAY WEDNESDAY THURSDAY FRIDAY
- Fractional Colorings and Zykov Products of By Nichole Schimanski
- Some Review Problems for the First Exam I. True or False? You need not prove your answers.
- Some Review Problems for Exam I I. (a) Find the greatest common divisor of 488 and 223.
- Solutions for Exam III Review 1. Base case. When n = 1, 16 25 -9 25 1 -10(1).
- Number Theory MTH 346, Fall 2011, Section 1
- Solutions for First Exam I. By induction on n.
- Some Review Problems for Exam II I. For each of the following, find a complete set of mutually incongruent solutions for the
- Circulant Graphs, J(v,k,i) Graphs, and Homomorphisms
- Vertex, Edge, and Arc Transitivity
- Algebraic Graph Theory, I MTH 661, Fall 2011, Section 1
- Solutions for Exam II Review I. (a). Note that gcd(7, 11) = 1, and 1|5, so one solution exists (mod 11). If
- Vertex-Transitivity and Matchings
- The Atomic Theory of Vertex-Transitivity
- Math 346 -Second Exam (Solutions) I. (a) By way of contradiction, assume it is rational. Then we can write 3
- Introduction to Graphs Emphasizing graphs, subgraphs, and
- Counting (labeled) graphs Fix a set of vertices V={1,2,3,4}.
- Some Review Problems for Exam III 1. Prove that for all integers n 1,
- Group Actions Emphasizing
- JOHN S. CAUGHMAN, IV Professor of Mathematics
- HYPERGRAPHS WITH A UNIQUE PERFECT MATCHING AARON SPINDEL
- Hamiltonicity and Vertex-Transitivity
- Vertex-Transitive Graphs are Retracts of Cayley Graphs
- s-Arc Transitivity Emphasizing the results of Tutte
- When is a graph a Cayley Graph?
- Cycloids and Paths Why does a cycloid-constrained pendulum
- Cycloids and Paths An MST 501 Project Presentation
- A closer look at some very special cubic graphs
