Search results
Jump to navigation
Jump to search
Page title matches
- '''Combinatorics''' is a branch of [[mathematics]] that concerns itself, at the elementary l ...l combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.1 KB (165 words) - 10:24, 18 June 2009
- | title = A course in combinatorics316 bytes (39 words) - 11:06, 18 June 2009
- 123 bytes (15 words) - 11:44, 18 June 2009
- ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}610 bytes (72 words) - 10:57, 18 June 2009
Page text matches
- ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}610 bytes (72 words) - 10:57, 18 June 2009
- '''Combinatorics''' is a branch of [[mathematics]] that concerns itself, at the elementary l ...l combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.1 KB (165 words) - 10:24, 18 June 2009
- The disciplines within mathematics that study discrete objects: combinatorics, graph theory, number theory, mathematical logic, …167 bytes (18 words) - 09:28, 18 June 2009
- | title = A course in combinatorics316 bytes (39 words) - 11:06, 18 June 2009
- {{r|Combinatorics}}255 bytes (36 words) - 11:43, 18 June 2009
- {{r|Combinatorics}}233 bytes (28 words) - 06:45, 15 July 2008
- {{r|Combinatorics}}245 bytes (29 words) - 09:38, 18 June 2009
- The '''Cameron–Erdős conjecture''' in the field of [[combinatorics]] is the statement that the number of [[sum-free set]]s contained in <math>368 bytes (56 words) - 11:47, 18 June 2009
- {{r|Combinatorics}}542 bytes (64 words) - 16:48, 11 January 2010
- {{r|Combinatorics}}441 bytes (57 words) - 16:21, 11 January 2010
- | title = Notes on introductory combinatorics731 bytes (88 words) - 06:16, 9 January 2008
- {{r|Combinatorics}}456 bytes (58 words) - 19:33, 11 January 2010
- {{r|Combinatorics}}489 bytes (62 words) - 20:38, 11 January 2010
- {{r|Combinatorics}}529 bytes (67 words) - 17:25, 11 January 2010
- {{r|Combinatorics}}547 bytes (69 words) - 15:56, 11 January 2010
- {{r|Combinatorics}}797 bytes (101 words) - 16:58, 11 January 2010
- {{r|Combinatorics}}654 bytes (81 words) - 13:36, 29 November 2008
- {{r|Combinatorics}}971 bytes (150 words) - 10:45, 4 October 2013
- ...nalysis|real]] and [[complex analysis]] to problems in [[algorithmics]], [[combinatorics]], [[number theory]], [[probability]] and other areas. It is the basis of1 KB (148 words) - 13:24, 19 December 2009
- ...hor=Victor Bryant | coauthors=Hazel Perfect | title=Independence Theory in Combinatorics | publisher=Chapman and Hall | year=1980 | isbn=0-412-22430-5 }}2 KB (200 words) - 13:08, 2 January 2013