Kenneth P. Bogart | Academic Influence

Kenneth P. Bogart's AcademicInfluence.com Rankings

Kenneth P. Bogart

Mathematics

#7664

World Rank

#10396

Historical Rank

#2081

USA Rank

Measure Theory

#3473

World Rank

#4098

Historical Rank

#1004

USA Rank

mathematics Degrees

Download Badge

Mathematics

Kenneth P. Bogart's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Kenneth P. Bogart Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Kenneth Paul Bogart was an American mathematician known for his work on preference structures and for his textbook on combinatorics. He was a professor at Dartmouth College. Education and career Bogart was originally from Cincinnati, and was a 1965 graduate of Marietta College. He earned his Ph.D. in 1968 at the California Institute of Technology. His dissertation, Structure Theorems for Local Noether Lattices, was supervised by Robert P. Dilworth.

(See a Problem?)

Kenneth P. Bogart's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introductory Combinatorics (1977) (692)
Preference structures I: Distances between transitive preference relations† (1973) (142)
Preference Structures. II: Distances Between Asymmetric Relations (1975) (96)
A short proof that 'proper = unit' (1998) (78)
Proper and Unit Tolerance Graphs (1995) (70)
An Elementary Proof of the MacWilliams Theorem on Equivalence of Codes (1978) (53)
A Bound on the Dimension of Interval Orders (1976) (53)
On the complexity of posets (1976) (43)
An obvious proof of Fishburn's interval order theorem (1993) (41)
Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n (1973) (39)
The Dilworth Theorems (1990) (36)
Non-sexist solution of the menage problem (1986) (29)
Maximal dimensional partially ordered sets I. Hiraguchi's theorem (1973) (28)
Bipartite tolerance orders (1994) (27)
Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension (1976) (26)
Some Social Science Applications of Ordered Sets (1982) (26)
Structure theorems for regular local Noether lattices. (1968) (25)
Incidence codes of posets: Eulerian posets and Reed-Muller codes (1980) (24)
Distributive local Noether lattices. (1969) (23)
The Dilworth Theorems: Selected Papers of Robert P. Dilworth (1990) (19)
Proper and unit bitolerance orders and graphs (1998) (19)
An obvious proof of Burnside's Lemma (1991) (14)
The Geometry of Dowling Lattices (1994) (12)
Proper and Unit Trapezoid Orders and Graphs (1996) (11)
Consensus Signed Digraphs (1979) (11)
A geometric characterization of dowling lattices (1991) (10)
Simple Inductive Proofs of the Fishburn and Mirkin Theorem and the Scott–Suppes Theorem (2003) (8)
Interval orders Based on Weak orders (1995) (8)
Counting $3$ by $n$ Latin rectangles (1976) (8)
Characterizations of partition lattices (1984) (7)
Intervals and Orders: What Comes After Interval Orders? (1994) (7)
The Impact of the Chain Decomposition Theorem on Classical Combinatorics (1990) (6)
Triangle, Parallelogram, and Trapezoid Orders (2010) (6)
Discrete Mathematics for Computer Scientists (2010) (6)
Tolerance orders and bipartite unit tolerance graphs (2001) (5)
Hypergraphs, characteristic polynomials and permutation characters (1979) (5)
Discrete mathematics for computer science (2005) (5)
Bounded bitolerance digraphs (2000) (4)
Introductory Programming for Discrete Mathematics (1988) (3)
Comparability Invariance Results for Tolerance Orders (2001) (3)
Nonimbeddable Noether lattices (1969) (3)
Decomposing partial orderings into chains (1970) (3)
Discrete Math in Computer Science (2002) (2)
A fresh(man) treatment of determinants (1989) (2)
Small regular local Noether lattices. I (1970) (2)
Idempotent Noether lattices (1969) (1)
A note on matrices of zeros and ones (1974) (1)
Join Congruence Relations on Geometric Lattices (1999) (1)
Non-Unit Free Triangle Orders (2006) (1)
Join congruence relations and closure relations (2003) (1)
Structure theorems for local Noether lattices (1968) (1)
R. P. Dilworth (1995) (1)
Ideal and Exterior Weight Enumerators for Linear Codes: Examples and Conjectures (1983) (1)
Basic Algebra. By Nathan Jacobson. Volume I (1974) and II (1980). W. H. Freeman, San Francisco. Algebra (second edition). By Saunders Mac Lane and Garrett Birkhoff (1985) (1)
The Number of Indecomposable Codes (1977) (0)
Instructor's guide for discrete mathematics (1988) (0)
A Finite Non-Unit Free Triangle Order (2006) (0)
Ordered Sets (2001) (0)
Characterizations ot partition lattices (2005) (0)
SMALL REGULAR LOCAL NOETHER LATTICES. I1 (2010) (0)
The Calculus of Population. (1974) (0)
SMALL REGULAR LOCAL NOETHER LATTICES. I1 (2010) (0)
Introduction to Combinatorial Theory.@@@Applied Combinatorics.@@@Introductory Combinatorics. (1985) (0)

This paper list is powered by the following services:

Other Resources About Kenneth P. Bogart

en.wikipedia.org

What Schools Are Affiliated With Kenneth P. Bogart?

Kenneth P. Bogart is affiliated with the following schools: