All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

206 223 (0,266s)

Result

Representations of monotone Boolean functions by linear programs

theorems for Lovász-Schrijver proof systems and for mixed Lovász-Schrijver proof systems. (4) The Lovász-Schrijver proof system cannot be pol...

Pure mathematics

  • 2019
  • Jimp
  • Link
Result

Representations of monotone Boolean functions by linear programs

for Lovasz-Schrijver proof systems, and for mixed Lovasz-Schrijver proof systems. 4. The Lovasz-Schrijver proof system cannot be polynomially simulated by the cutting p...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • D
  • Link
Result

Edge-critical subgraphs of Schrijver graphs II: The general case

We give a simple combinatorial description of an (n-2k+2)-chromatic edge-critical subgraph of the Schrijver graph SG(n,k), itself an induced vertex-critical and Stehlík (2020) to all values of k, and sharpens the classical results of Lov...

Pure mathematics

  • 2022
  • Jimp
  • Link
Result

Colouring quadrangulations of projective spaces

graphs, all Mycielski graphs, and certain graphs homomorphic to Schrijver graphs. As a corollary, we obtain a new proof of the Lovász-Kneser theorem....

BA - Obecná matematika

  • 2015
  • Jx
  • Link
Result

Edge-critical subgraphs of Schrijver graphs

For k≥1 and n≥2k, the Kneser graph KG(n,k) has all k-element subsets of an n-element set as vertices; two such subsets are adjacent if they are disjoint. It was first proved by Lovász that the chromatic number of KG(n,k) is n−2k+2. Schri...

Pure mathematics

  • 2020
  • Jimp
  • Link
Result

Schrijver graphs and projective quadrangulations

integers k≥1 and n≥2k+1, the Schrijver graph SG(n,k) contains a spanning subgraph which...

Pure mathematics

  • 2017
  • C
  • Link
Result

Mathematics of László Lovász

The profile of László Lovász from the official compendium of the Abel prize winners from the years 2018-2022.

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • C
  • Link
Result

Hamiltonicity of Schrijver graphs and stable Kneser graphs

For integers k>=1 and n>=2k+1, the Schrijver graph S(n,k) has as vertices all k-element subsets of [n]:={1,2,...,n} that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More generally, for intege...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2025
  • Jimp
  • Link
Result

Computing Superdifferentials of Lovász Extension with Application to Coalitional Game

Every coalitional game can be extended from the powerset onto the real unit cube. One of possible approaches is the Lovász extension, which is the same as the discrete Choquet integral with respect to the coalitional game. We will study some...

BA - Obecná matematika

  • 2016
  • D
  • Link
Result

Cut-norm and entropy minimization over weak* limits

and strictly concave function. As a corollary, we obtain a new proof of compactness...

Pure mathematics

  • 2019
  • Jimp
  • Link
  • 1 - 10 out of 206 223