Matches in SemOpenAlex for { <https://semopenalex.org/work/W2952210779> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2952210779 abstract "The minrank over a field F of a graph G on the vertex set l 1,2,… ,nr is the minimum possible rank of a matrix M ∈ Fn × n such that Mi, i ≠ 0 for every i, and Mi, j =0 for every distinct non-adjacent vertices i and j in G. For an integer n, a graph H, and a field F, let g(n,H, F) denote the maximum possible minrank over F of an n-vertex graph whose complement contains no copy of H. In this article, we study this quantity for various graphs H and fields F. For finite fields, we prove by a probabilistic argument a general lower bound on g(n,H,F), which yields a nearly tight bound of Ω (S n/ log n) for the triangle H=K3. For the real field, we prove by an explicit construction that for every non-bipartite graph H, g(n,H, R) ≥ nδ for some δ = δ (H)> 0. As a by-product of this construction, we disprove a conjecture of Codenotti et al. [11]. The results are motivated by questions in information theory, circuit complexity, and geometry." @default.
- W2952210779 created "2019-06-27" @default.
- W2952210779 creator A5020923873 @default.
- W2952210779 date "2018-01-01" @default.
- W2952210779 modified "2023-09-28" @default.
- W2952210779 title "On Minrank and Forbidden Subgraphs." @default.
- W2952210779 hasPublicationYear "2018" @default.
- W2952210779 type Work @default.
- W2952210779 sameAs 2952210779 @default.
- W2952210779 citedByCount "0" @default.
- W2952210779 crossrefType "proceedings-article" @default.
- W2952210779 hasAuthorship W2952210779A5020923873 @default.
- W2952210779 hasConcept C114614502 @default.
- W2952210779 hasConcept C118615104 @default.
- W2952210779 hasConcept C132525143 @default.
- W2952210779 hasConcept C134306372 @default.
- W2952210779 hasConcept C197657726 @default.
- W2952210779 hasConcept C2780990831 @default.
- W2952210779 hasConcept C33923547 @default.
- W2952210779 hasConcept C77553402 @default.
- W2952210779 hasConcept C77926391 @default.
- W2952210779 hasConcept C80899671 @default.
- W2952210779 hasConceptScore W2952210779C114614502 @default.
- W2952210779 hasConceptScore W2952210779C118615104 @default.
- W2952210779 hasConceptScore W2952210779C132525143 @default.
- W2952210779 hasConceptScore W2952210779C134306372 @default.
- W2952210779 hasConceptScore W2952210779C197657726 @default.
- W2952210779 hasConceptScore W2952210779C2780990831 @default.
- W2952210779 hasConceptScore W2952210779C33923547 @default.
- W2952210779 hasConceptScore W2952210779C77553402 @default.
- W2952210779 hasConceptScore W2952210779C77926391 @default.
- W2952210779 hasConceptScore W2952210779C80899671 @default.
- W2952210779 hasLocation W29522107791 @default.
- W2952210779 hasOpenAccess W2952210779 @default.
- W2952210779 hasPrimaryLocation W29522107791 @default.
- W2952210779 hasRelatedWork W1897557205 @default.
- W2952210779 hasRelatedWork W1967072319 @default.
- W2952210779 hasRelatedWork W2005791424 @default.
- W2952210779 hasRelatedWork W2008729281 @default.
- W2952210779 hasRelatedWork W2096875564 @default.
- W2952210779 hasRelatedWork W2172837624 @default.
- W2952210779 hasRelatedWork W2300867421 @default.
- W2952210779 hasRelatedWork W2402766034 @default.
- W2952210779 hasRelatedWork W2912124299 @default.
- W2952210779 hasRelatedWork W2943357508 @default.
- W2952210779 hasRelatedWork W2949606243 @default.
- W2952210779 hasRelatedWork W2950039013 @default.
- W2952210779 hasRelatedWork W2962736919 @default.
- W2952210779 hasRelatedWork W2963094437 @default.
- W2952210779 hasRelatedWork W2963500080 @default.
- W2952210779 hasRelatedWork W3004825103 @default.
- W2952210779 hasRelatedWork W3103974728 @default.
- W2952210779 hasRelatedWork W3165892239 @default.
- W2952210779 hasRelatedWork W3190674309 @default.
- W2952210779 hasRelatedWork W3210829833 @default.
- W2952210779 isParatext "false" @default.
- W2952210779 isRetracted "false" @default.
- W2952210779 magId "2952210779" @default.
- W2952210779 workType "article" @default.