#	Pagina
attuale pagina	/open-h2020/projects/194538/index.html

Opendata, web and dolomites

LaDIST SIGNED

Large Discrete Structures

Total Cost €

EC-Contrib. €

Partnership

Views

Outcomes and
results

LaDIST project word cloud

Explore the words cloud of the LaDIST project. It provides you a very rough idea of what is the project "LaDIST" about.

analyze frameworks arguments enormous conjunction extremal proposing science analytic optimization sparse input structure graphs algorithmic approximate asymptotic emerged solutions theory combined bridging behavior limits limit combinatorics dense insights combinatorial structural logic structures introduce computer sizes objects discrete

Project "LaDIST" data sheet

The following table provides information about the project.

Coordinator	Masarykova univerzita Organization address address: Zerotinovo namesti 9 city: BRNO STRED postcode: 60177 website: http://www.muni.cz contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.
Coordinator Country	Czech Republic [CZ]
Project website	http://www2.warwick.ac.uk/fac/sci/maths/people/staff/daniel_kral/ladist/
Total cost	1˙386˙859 €
EC max contribution	1˙386˙859 € (100%)
Programme	1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
Code Call	ERC-2014-CoG
Funding Scheme	ERC-COG
Starting year	2015
Duration (year-month-day)	from 2015-12-01 to 2021-07-31

Partnership

Take a look of project's partnership.

#	participants	country	role	EC contrib. [€]
1	Masarykova univerzita Masarykova univerzita Organization address address: Zerotinovo namesti 9 city: BRNO STRED postcode: 60177 website: http://www.muni.cz contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	CZ (BRNO STRED)	coordinator	588˙038.00
2	THE UNIVERSITY OF WARWICK THE UNIVERSITY OF WARWICK Organization address address: Kirby Corner Road - University House city: COVENTRY postcode: CV4 8UW website: www.warwick.ac.uk contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	UK (COVENTRY)	participant	674˙195.00
3	UNIWERSYTET JAGIELLONSKI UNIWERSYTET JAGIELLONSKI Organization address address: Ul. Golebia 24 city: KRAKOW postcode: 31007 website: n.a. contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	PL (KRAKOW)	participant	124˙625.00

Map

Project objective

The proposed project seeks to introduce novel methods to analyze and approximate large graphs and other discrete structures and to apply the developed methods to solve specific open problems. A need for such methods comes from computer science where the sizes of input structures are often enormous. Specifically, the project will advance the recently emerged theory of combinatorial limits by developing new insights in the structure of limit objects and by proposing a robust theory bridging the sparse and dense cases. The analytic methods from the theory of combinatorial limits will be used to analyze possible asymptotic behavior of large graphs and they will be applied in conjunction with structural arguments to provide solutions to specific problems in extremal combinatorics. The obtained insights will also be combined with methods from discrete optimization and logic to provide new algorithmic frameworks.

Publications

List of publications.
year	authors and title	journal	last update
2012	LÃ¡szlÃ³ LovÃ¡sz, BalÃ¡zs Szegedy Random graphons and a weak Positivstellensatz for graphs published pages: 214-225, ISSN: 0364-9024, DOI: 10.1002/jgt.20611	Journal of Graph Theory 70/2	2020-01-24
2019	Chan, Timothy F. N.; Grzesik, Andrzej; Kral, Daniel; Noel, Jonathan A. Cycles of length three and four in tournaments published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	Pach, PÃ©ter PÃ¡l An improved upper bound for the size of the multiplicative 3-Sidon sets published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	KrÃ¡l\', Daniel; Martins, TaÃsa; Pach, PÃ©ter PÃ¡l; Wrochna, Marcin The step Sidorenko property and non-norming edge-transitive graphs published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2017	Roman Glebov, Carlos Hoppen, Tereza KlimoÅ¡ovÃ¡, Yoshiharu Kohayakawa, Daniel KrÃ¡lâ€™, Hong Liu Densities in large permutations and parameter testing published pages: 89-99, ISSN: 0195-6698, DOI: 10.1016/j.ejc.2016.09.006	European Journal of Combinatorics 60	2020-01-24
2018	Kyle Kloster, Daniel KrÃ¡l\', Blair D. Sullivan Walk entropy and walk-regularity published pages: 115-121, ISSN: 0024-3795, DOI: 10.1016/j.laa.2018.02.009	Linear Algebra and its Applications 546	2020-01-24
2018	Liu, Hong; Pach, PÃ©ter PÃ¡l; Palincza, RichÃ¡rd The number of maximum primitive sets of integers published pages: , ISSN: , DOI:	arXiv	2020-01-24
2017	KrÃ¡l\', Daniel; LidickÃ½, Bernard; Martins, TaÃsa L.; Pehova, Yanitsa Decomposing graphs into edges and triangles published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	Kral, Daniel; Norin, Sergey; Volec, Jan A bound on the inducibility of cycles published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2017	Andrzej Grzesik, Daniel KrÃ¡l\', LÃ¡szlÃ³ MiklÃ³s LovÃ¡sz Extremal graph theory and finite forcibility published pages: 541-547, ISSN: 1571-0653, DOI: 10.1016/j.endm.2017.07.005	Electronic Notes in Discrete Mathematics 61	2020-01-24
2018	Roman Glebov, Tereza Klimosova, Daniel Kral Infinite dimensional finitely forcible graphon published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	D. KrÃ¡Ä¾, L. M. LovÃ¡sz, J. A. Noel, J. Sosnovec Finitely forcible graphons with an almost arbitrary structure published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	Grzesik, Andrzej; KrÃ¡l\', Daniel; LovÃ¡sz, LÃ¡szlÃ³ MiklÃ³s Elusive extremal graphs published pages: , ISSN: , DOI:	arXiv	2020-01-24
2018	Nenadov, Rajko; Pehova, Yanitsa On a Ramsey-Tur\'an variant of the Hajnal-Szemer\'edi theorem published pages: , ISSN: , DOI:	arXiv	2020-01-24
2019	Geneson, Jesse; Holmes, Amber; Liu, Xujun; Neidinger, Dana; Pehova, Yanitsa; Wass, Isaac Ramsey numbers of ordered graphs under graph operations published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2018	Liu, Hong; Pach, PÃ©ter PÃ¡l; SÃ¡ndor, Csaba Polynomial Schur\'s theorem published pages: , ISSN: , DOI:	ArXiv	2020-01-24
2019	Liu, Hong; Pach, PÃ©ter PÃ¡l The number of multiplicative Sidon sets of integers published pages: , ISSN: , DOI:	ArXiv	2020-01-24

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "LADIST" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "LADIST" are provided by the European Opendata Portal: CORDIS opendata.