@article{MTMT:33688473,
	title = {On a question of Vera T. Sós about size forcing of graphons},
	url = {https://m2.mtmt.hu/api/publication/33688473},
	author = {Cooley, O. and Kang, M. and Pikhurko, O.},
	doi = {10.1007/s10474-022-01265-8},
	journal-iso = {ACTA MATH HUNG},
	journal = {ACTA MATHEMATICA HUNGARICA},
	volume = {168},
	unique-id = {33688473},
	issn = {0236-5294},
	abstract = {The k-sampleG(k, W) from a graphon W: [ 0 , 1 ] 2→ [ 0 , 1 ] is the random graph on { 1 , … , k} , where we sample x1, … , xk∈ [ 0 , 1 ] uniformly at random and make each pair { i, j} ⊆ { 1 , … , k} an edge with probability W(xi, xj) , with all these choices being mutually independent. Let the random variable Xk(W) be the number of edges in G(k, W). Vera T. Sós asked in 2012 whether two graphons U, W are necessarily weakly isomorphic if the random variables Xk(U) and Xk(W) have the same distribution for every integer k≥ 2. This question when one of the graphons W is a constant function was answered positively by Endre Csóka and independently by Jacob Fox, Tomasz Łuczak and Vera T. Sós. Here we investigate the question when W is a 2-step graphon and prove that the answer is positive for a 3-dimensional family of such graphons. We also present some related results. © 2022, Akadémiai Kiadó, Budapest, Hungary.},
	keywords = {GRAPHON; k-sample; graphon forcing; graph container},
	year = {2022},
	eissn = {1588-2632},
	pages = {1-26}
}

@{MTMT:33103071,
	title = {On a Question of Vera T. Sós About Size Forcing of Graphons},
	url = {https://m2.mtmt.hu/api/publication/33103071},
	author = {Cooley, O. and Kang, M. and Pikhurko, O.},
	booktitle = {Singularities and Their Interaction with Geometry and Low Dimensional Topology},
	doi = {10.1007/978-3-030-83823-2_100},
	volume = {14},
	unique-id = {33103071},
	year = {2021},
	pages = {625-630}
}