Search results

Page title matches

• Combinatorics
  '''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
• Talk:Combinatorics
  12 bytes (1 word) - 10:26, 18 June 2009
• Template:Combinatorics/Metadata
  | pagename = Combinatorics | abc = Combinatorics
  727 bytes (58 words) - 10:27, 18 June 2009
• Combinatorics/Definition
  123 bytes (15 words) - 11:44, 18 June 2009
• Combinatorics/Bibliography
  | title = A course in combinatorics
  316 bytes (39 words) - 11:06, 18 June 2009
• Combinatorics/Related Articles
  ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}
  610 bytes (72 words) - 10:57, 18 June 2009

Page text matches

• Combinatorics/Related Articles
  ===Other topics in enumerative combinatorics=== {{r|Algebraic combinatorics}}
  610 bytes (72 words) - 10:57, 18 June 2009
• Combinatorics
  '''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
• Template:Combinatorics/Metadata
  | pagename = Combinatorics | abc = Combinatorics
  727 bytes (58 words) - 10:27, 18 June 2009
• Discrete mathematics/Definition
  The disciplines within mathematics that study discrete objects: combinatorics, graph theory, number theory, mathematical logic, …
  167 bytes (18 words) - 09:28, 18 June 2009
• User:Eyal Rozenman
  Combinatorics, Theory of computer science. quences of graphs. Graphs and Combinatorics `03.
  1 KB (199 words) - 03:51, 22 November 2023
• Combinatorics/Bibliography
  | title = A course in combinatorics
  316 bytes (39 words) - 11:06, 18 June 2009
• Cameron–Erdős conjecture/Related Articles
  {{r|Combinatorics}}
  255 bytes (36 words) - 11:43, 18 June 2009
• User:Veselin Vavrek
  My fields of Interest are Coding Theory (linear binary codes), Combinatorics (Fibonacci polynomials) and Number Theory (Paley type conference matrices).
  415 bytes (56 words) - 04:50, 22 November 2023
• User:Nathan Bloomfield
  ...nt in math at [[Missouri State University]], doing research in [[algebraic combinatorics]].
  392 bytes (52 words) - 04:27, 22 November 2023
• Binomial coefficient/Related Articles
  {{r|Combinatorics}}
  233 bytes (28 words) - 06:45, 15 July 2008
• User:David M. Shor
  I have a strong background in Set Theory, Analysis, Algebra, and Combinatorics. I also have spent quite a bit of time studying the Middle East. I've taken
  439 bytes (67 words) - 03:44, 22 November 2023
• Discrete mathematics/Related Articles
  {{r|Combinatorics}}
  245 bytes (29 words) - 09:38, 18 June 2009
• Cameron–Erdős conjecture
  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
• User:Vladimir Reshetnikov
  ...ematics, order theory, type theory, computability theory, graph theory and combinatorics.
  524 bytes (72 words) - 04:51, 22 November 2023
• User:Pedro David Sanchez Salazar
  ...h my mathematics doctorate at UNAM in mexico, my main area being algebraic combinatorics and representations theory.
  448 bytes (66 words) - 04:31, 22 November 2023
• Generating function/Related Articles
  {{r|Combinatorics}}
  542 bytes (64 words) - 16:48, 11 January 2010
• Erdős–Fuchs theorem/Related Articles
  {{r|Combinatorics}}
  441 bytes (57 words) - 16:21, 11 January 2010
• Robert Tarjan/Bibliography
  | title = Notes on introductory combinatorics
  731 bytes (88 words) - 06:16, 9 January 2008
• Pigeonhole principle/Related Articles
  {{r|Combinatorics}}
  456 bytes (58 words) - 19:33, 11 January 2010
• Stirling number/Related Articles
  {{r|Combinatorics}}
  489 bytes (62 words) - 20:38, 11 January 2010