About: Pseudorandom sets and explicit constructions of Ramsey graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Pseudorandom sets and explicit constructions of Ramsey graphs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We shall show a polynomial time construction of a graph $G$ on $N$ vertices such that $G$ does not contain $K_{r,r}$and$/overline{K}_{r,r}$, for $r=/sqrt{N}/{2^{/epsilon/sqrt{/log N}}}=o(/sqrt{N})$. To this end we construct a subset $X/subseteq F^m$ which has small intersections with all subspaces of dimension $m/2$. We shall show a polynomial time construction of a graph $G$ on $N$ vertices such that $G$ does not contain $K_{r,r}$and$/overline{K}_{r,r}$, for $r=/sqrt{N}/{2^{/epsilon/sqrt{/log N}}}=o(/sqrt{N})$. To this end we construct a subset $X/subseteq F^m$ which has small intersections with all subspaces of dimension $m/2$. (en) Ukazujeme casově polynomiální konstrukci grafu $G$ na $N$ vrcholech takovou, že $G$ neobsahuje $K_{r,r}$ ani $/overline {K}_{r,r}$, pro $r=/sqrt{N}/{2^{/epsilon/sqrt{/log N}}}=o(/sqrt{N})$. K tomuto účelu sestrojíme podmnožinu $X/subseteq F^m$, která má malé průniky se všemi podprostory dimenze $m/2$. (cs)
Title	Pseudorandom sets and explicit constructions of Ramsey graphs Pseudorandom sets and explicit constructions of Ramsey graphs (en) Pseudonáhodné množiny a ramseyovské grafy (cs)
skos:prefLabel	Pseudorandom sets and explicit constructions of Ramsey graphs Pseudorandom sets and explicit constructions of Ramsey graphs (en) Pseudonáhodné množiny a ramseyovské grafy (cs)
skos:notation	RIV/67985840:_____/04:00021599!RIV06-AV0-67985840
http://linked.open.../vavai/riv/strany	327;346
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(IAA1019401), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat	2006
http://linked.open...aciTvurceVysledku	Pudlák, Pavel
http://linked.open.../riv/druhVysledku	C - Kapitola v knize
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	583101
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/04:00021599
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ramsey graphs; explicit constructions (en)
http://linked.open.../riv/klicoveSlovo	explicit constructions ramsey graphs
http://linked.open...ontrolniKodProRIV	[668729BD2304]
http://linked.open...i/riv/mistoVydani	Napoli
http://linked.open...vEdiceCisloSvazku	Quaderni di matematica, 13
http://linked.open...i/riv/nazevZdroje	Complexity of computations and proofs
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Theories, proofs and computational complexity
http://linked.open...UplatneniVysledku	2004
http://linked.open...iv/tvurceVysledku	Pudlák, Pavel Rödl, V.
http://linked.open...n/vavai/riv/zamer	Complex development of all branches of mathematics with regard to the needs of physics and technology
number of pages	20 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Dipartimento di Matematica della Seconda Universita di Napoli
https://schema.org/isbn	88-7999-413-1

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software