Search results

== Extremal hypergraphs == An '''extremal hypergraph''' to Ryser's conjecture is a hypergraph in which the conjecture ...

...dges. Thus it has its application in [[extremal graph theory]], [[additive combinatorics]] and [[Ramsey theory]]. ...urán Numbers of Bipartite Graphs and Related Ramsey-Type Questions|journal=Combinatorics, Probability and Computing|volume=12|issue=5+6|pages=477–494|doi=10.1017/S0 ...

|fields = [[Mathematics]]<br>[[Combinatorics]]<br>[[Graph theory]] ...a Hungarian-American mathematician, specializing in [[graph theory]] and [[combinatorics]]. ...

...A.|title=A dynamic survey of graph labeling|journal=Electronic Journal of Combinatorics|pages=DS6|date=January 3, 2007|doi=10.37236/27|doi-access=free}}.</ref> | title = Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I ...

...that direction.{{ran|E}}{{ran|T}} However, much of his later work was in [[extremal graph theory]]. He is known for formulating the [[Ruzsa–Szemerédi problem]] | title = Some extremal problems on {{mvar|r}}-graphs ...

| known_for = [[combinatorics]], [[additive number theory]], [[Ramsey theory]], [[graph theory]] *[[European Prize in Combinatorics]] (2013) ...

| awards = [[European Prize in Combinatorics]] (2009)<ref>{{citation|journal=British Combinatorial Newsletter|pages=3–4| ...eevash''' (born 30 November 1978) is a British mathematician, working in [[combinatorics]]. He is a professor of mathematics at the [[University of Oxford]] and a F ...

...rking in [[combinatorics]], mainly in [[discrete geometry]] and [[extremal combinatorics]]. He was a student of [[Gyula O. H. Katona]]. He is a corresponding member ...

...inatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics'', [[Béla Bollobás]], 1986, {{ISBN|0-521-33703-8}}, [https://books.google.c The '''extremal number''' <math>\operatorname{ex}(n,G)</math> is the maximum number of edge ...

...h interests are in [[Extremal combinatorics|extremal]] and [[probabilistic combinatorics]], [[Ramsey theory]], random polynomials and matrices, and [[combinatorial ...lso contributes significantly to the field of mathematics, particularly in combinatorics and polynomial analysis. ...

==Combinatorics of dual affine planes== ...y|first3=Alexey|last4=Szabó|first4=Tibor|date=2018-07-12|title=A family of extremal hypergraphs for Ryser's conjecture|class=math.CO|eprint=1605.06361}}</ref> ...

{{Short description|Notion in combinatorics}}[[File:Sauer–Shelah lemma.svg|thumb|upright=1.35|Pajor's formulation of th In [[combinatorics|combinatorial mathematics]] and [[extremal set theory]], the '''Sauer–Shelah lemma''' states that every [[family of se ...

{{Short description|Theorem in extremal set theory}} In [[extremal set theory]], the '''Ahlswede–Khachatrian theorem''' generalizes the [[Erdő ...

| thesis_title = Embedding subgraphs and coloring graphs under extremal degree conditions |journal = European Journal of Combinatorics ...

...ithms: the first family, called '''polytope norm methods''', construct the extremal norm by computing long trajectories of points.<ref>V. Y. Protasov. "The joi The second family of methods approximate the extremal norm with '''modern optimization techniques''', such as ellipsoid norm appr ...

In the [[Mathematics|mathematical]] field of [[extremal graph theory]], '''homomorphism density''' with respect to a graph <math>H< Many results in [[extremal graph theory]] can be described by inequalities involving homomorphism dens ...

In [[arithmetic combinatorics]], '''Behrend's theorem''' states that the subsets of the [[integer]]s from | title = On an extremal problem concerning primitive sequences ...

...s/index.php/eljc/article/view/v20i1p26/0|journal=The Electronic Journal of Combinatorics|volume=20|issue=1|issn=1077-8926|doi=10.37236/2394|doi-access=free}}</ref> ...cer Games on Hypergraphs with Small Rank|journal=The Electronic Journal of Combinatorics|language=en-US|volume=21|issue=1|pages=1–2|issn=1077-8926|doi=10.37236/3095 ...

In [[combinatorics|combinatorial mathematics]] and [[extremal graph theory]], the '''Ruzsa–Szemerédi problem''' or '''(6,3)-problem''' as | contribution = Some extremal problems on {{mvar|r}}-graphs ...

...at the [[Alfréd Rényi Institute of Mathematics]], Budapest. He works in [[combinatorics]] and [[group theory]]. ...ló Lovász]] and [[Gyula O. H. Katona|Gyula O.H. Katona]] with the thesis ''Extremal Structures and Covering Problems.''<ref>{{Cite web|url=https://www.genealog ...