About: Extremal combinatorics

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Extremal combinatorics Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FExtremal_combinatorics

Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics. Extremal combinatorics studies how large or how small a collection of finite objects (numbers, graphs, vectors, sets, etc.) can be, if it has to satisfy certain restrictions.

Attributes	Values
rdfs:label	Extremal combinatorics (en) Combinatoire extrémale (fr)
rdfs:comment	La combinatoire extrémale est un domaine de la combinatoire, qui est elle-même une partie des mathématiques. La combinatoire extrémale étudie de quelle taille une collection d'objets finis (nombres, graphes, vecteurs, ensembles, etc.) peut être, si elle doit répondre à certaines restrictions. (fr) Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics. Extremal combinatorics studies how large or how small a collection of finite objects (numbers, graphs, vectors, sets, etc.) can be, if it has to satisfy certain restrictions. (en)
dcterms:subject	Combinatorial optimization Combinatorics
Wikipage page ID	2675917 (xsd:integer)
Wikipage revision ID	1122779141 (xsd:integer)
Link from a Wikipage to another Wikipage	Vector space Number Combinatorial optimization Mathematics Union-closed sets conjecture Class (set theory) Graph (discrete mathematics) Sauer–Shelah lemma Combinatorics Kruskal–Katona theorem Combinatorics Erdős–Ko–Rado theorem Ramsey theory Sperner's theorem Set (mathematics) Extremal graph theory Fisher's inequality Subset
Link from a Wikipage to an external page	http://lovelace.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/preface.html http://www.math.tau.ac.il/~nogaa/PDFS/epc7.pdf
sameAs	Extremal combinatorics Extremal combinatorics Extremal combinatorics Extremal combinatorics Extremal combinatorics
dbp:wikiPageUsesTemplate	dbt:Citation
has abstract	Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics. Extremal combinatorics studies how large or how small a collection of finite objects (numbers, graphs, vectors, sets, etc.) can be, if it has to satisfy certain restrictions. Much of extremal combinatorics concerns classes of sets; this is called extremal set theory. For instance, in an n-element set, what is the largest number of k-element subsets that can pairwise intersect one another? What is the largest number of subsets of which none contains any other? The latter question is answered by Sperner's theorem, which gave rise to much of extremal set theory. Another kind of example: How many people can be invited to a party where among each three people there are two who know each other and two who don't know each other? Ramsey theory shows that at most five persons can attend such a party. Or, suppose we are given a finite set of nonzero integers, and are asked to mark as large a subset as possible of this set under the restriction that the sum of any two marked integers cannot be marked. It appears that (independent of what the given integers actually are) we can always mark at least one-third of them. (en) La combinatoire extrémale est un domaine de la combinatoire, qui est elle-même une partie des mathématiques. La combinatoire extrémale étudie de quelle taille une collection d'objets finis (nombres, graphes, vecteurs, ensembles, etc.) peut être, si elle doit répondre à certaines restrictions. (fr)
gold:hypernym	Field
prov:wasDerivedFrom	wikipedia-en:Extremal_combinatorics?oldid=1122779141&ns=0
page length (characters) of wiki page	2535 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Extremal_combinatorics
is Link from a Wikipage to another Wikipage of	Pál Turán Péter Frankl Paul Erdős Glossary of areas of mathematics Convex Polytopes Zoltán Füredi Benny Sudakov Lisa Sauermann Sunflower (mathematics) Daniela Kühn Sperner's theorem Michael Krivelevich Penny Haxell Eurocomb Extremal Problems For Finite Sets Extremal graph theory Lists of mathematics topics Outline of combinatorics Taking Sudoku Seriously Extremal set theory
is Wikipage redirect of	Extremal set theory
is known for of	Daniela Kühn
is foaf:primaryTopic of	wikipedia-en:Extremal_combinatorics

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software