温馨提示：本站仅提供公开网络链接索引服务，不存储、不篡改任何第三方内容，所有内容版权归原作者所有
AI智能索引来源：http://www.eb.com/facts/combinatorics
点击访问原文链接

combinatorics Facts | Britannica

进入原网站 导航首页
SUBSCRIBESUBSCRIBESUBSCRIBEHomeHistory & SocietyScience & TechBiographiesAnimals & NatureGeography & TravelArts & CultureProConMoneyGames & QuizzesVideosOn This DayOne Good FactDictionaryNew ArticlesHistory & SocietyLifestyles & Social IssuesPhilosophy & ReligionPolitics, Law & GovernmentWorld HistoryScience & TechHealth & MedicineScienceTechnologyBiographiesBrowse BiographiesAnimals & NatureBirds, Reptiles & Other VertebratesEnvironmentFossils & Geologic TimeInsects & Other InvertebratesMammalsPlantsGeography & TravelGeography & TravelArts & CultureEntertainment & Pop CultureLiteratureSports & RecreationVisual ArtsImage GalleriesPodcastsSummariesTop QuestionsLists and StoriesBritannica KidsAsk the ChatbotGames & QuizzesHistory & SocietyScience & TechBiographiesAnimals & NatureGeography & TravelArts & CultureProConMoneyVideoscombinatoricsIntroductionHistoryEarly developmentsCombinatorics during the 20th centuryProblems of enumerationPermutations and combinationsBinomial coefficientsMultinomial coefficientsRecurrence relations and generating functionsPartitionsThe Ferrer diagramThe principle of inclusion and exclusion: derangementsPolya’s theoremThe Möbius inversion theoremSpecial problemsThe Ising problemSelf-avoiding random walkProblems of choiceSystems of distinct representativesRamsey’s numbersDesign theoryBIB (balanced incomplete block) designsPBIB (partially balanced incomplete block) designsLatin squares and the packing problemOrthogonal Latin squaresOrthogonal arrays and the packing problemGraph theoryDefinitionsEnumeration of graphsCharacterization problems of graph theoryApplications of graph theoryPlanar graphsThe four-colour map problemEulerian cycles and the Königsberg bridge problemDirected graphsCombinatorial geometrySome historically important topics of combinatorial geometryPacking and coveringPolytopesIncidence problemsHelly’s theoremMethods of combinatorial geometryExhausting the possibilitiesUse of extremal propertiesUse of transformations between different spaces and applications of Helly’s theoremReferences & Edit HistoryQuick Facts & Related TopicsImagescombinatorics summaryNumbers and MathematicsWhat is algebra?Who are the most well-known computer scientists?Is computer science used in video games?How do I learn computer science?HomeScienceMathematicsFacebookXhttps://www.britannica.com/facts/combinatoricsThe Information Architects of Encyclopaedia Britannica The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.See All Images →Ramsey’s numbersnecklace problemMöbius inversion theoremIsing problemdistinct representativeorthogonal arrayLatin squaredesignKönig’s theoremHall’s theoremanalysisprobability theorycryptologycomputer sciencealgebrastatisticsgeometryautomata theoryset theoryinformation theoryPaul ErdősAndrei OkounkovNumbers and MathematicsFacebookXYouTubeInstagramAbout Us & Legal InfoAdvertisingContact UsPrivacy PolicyTerms of UseEqual Opportunity

智能索引记录