Which subsets of an infinite random graph look random?

DOI10.1002/MALQ.201700008MaRDI QIDQ5109240zbMATH OpenOpenAlexFDO

Authors W. R. Brian

Publication date 11 May 2020

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.00744

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Subgraphs of Random Graphs
• Infinite partitions of random graphs
• Measures on the Random Graph
• Infinite paths and cliques in random graphs
• On universality of graphs with uniformly distributed edges

Cites work

• Algebra in the Stone-Čech compactification: theory and applications
• Asymmetric graphs
• Filtres: mesurabilité, rapidité, propriété de Baire forte
• scientific article; zbMATH DE number 4212111 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 1055778 (Why is no real title available?)
• On T. Bartoszynski's structure theorem for measurable filters
• On the independence number of random graphs
• On the structure of measurable filters on a countable set
• Sur une suite infinie de fonctions de classe 1 dont toute fonction d'accumulation est non mesurable
• Universal graphs and universal functions

Cited in

(2)

• Partitioning subgraphs of profinite ordered graphs
• Infinite partitions of random graphs

This page was built for publication: Which subsets of an infinite random graph look random?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109240)