Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

Separation Choosability and Dense Bipartite Induced Subgraphs

Esperet, L.
Kang, J.R.
Thomassé, S.

Publication date

January 2019

DOI

10.1017/S0963548319000026

Publisher

Cambridge University Press (CUP)

Abstract

Contains fulltext : 207677.pdf (postprint version ) (Open Access

Extracted data

Related items

Two simple sets that are not positively Borel

Veldman, W.H.M.

January 2005

Contains fulltext : 33125.pdf (Publisher’s version ) (Closed access

Sublinear Scaling for Multi-Client Private Information Retrieval

Lueks, W.
Goldberg, I.

January 2015

Contains fulltext : 143771.pdf (preprint version ) (Closed access

Complete sets of cooperations

Kupke, C.
Rutten, J.

January 2010

Contains fulltext : 83576.pdf (publisher's version ) (Closed access

Compactification and compactoidification

Beckenstein, E.
Narici, L.
Schikhof, W.H.

January 1995

Contains fulltext : 60076.pdf (publisher's version ) (Open Access

Decomposition of bounded degree graphs into C4-free subgraphs

Kang, J.R.
Perarnau, G.

January 2015

Contains fulltext : 141207.pdf (preprint version ) (Open Access

Separation Choosability and Dense Bipartite Induced Subgraphs

Esperet, Louis
Kang, Ross
Thomassé, Stéphan

January 2019

International audienceWe study a restricted form of list colouring, for which every pair of lists th...

Discrepancy and large dense monochromatic subsets

Kang, J.R.
Patel, V.
Regts, G.

January 2019

Contains fulltext : 204473.pdf (preprint version ) (Open Access

A decomposition theorem for domains

Haack, C.

January 1996

Contains fulltext : 161699.pdf (publisher's version ) (Open Access

Packing Graphs of Bounded Codegree

Cames van Batenburg, W.P.S.
Kang, J.R.

January 2018

Contains fulltext : 197583.pdf (publisher's version ) (Open Access

Toposes and groupoids

Moerdijk, I.

January 1988

Contains fulltext : 128966.pdf (publisher's version ) (Open Access

Supersaturation in the Boolean Lattice

Dove, A.P.
Griggs, J.R.
Kang, J.R.
Sereni, J.-S.

January 2014

Contains fulltext : 135163.pdf (preprint version ) (Open Access

Minimal Separating Sequences for All Pairs of States

Smetsers, R.
Moerman, J.S.
Jansen, D.N.

January 2016

Contains fulltext : 158117.pdf (publisher's version ) (Closed access

Two “simple” sets that are not positively Borel

Veldman, W.H.M.

January 2004

Contains fulltext : 60352.pdf (publisher's version ) (Open Access)53 p

Largest sparse subgraphs of random graphs

Fountoulakis, N.
Kang, J.R.
McDiarmid, C.

January 2014

Contains fulltext : 135134.pdf (preprint version ) (Open Access

Building sub-knowledge bases using concept lattices

Sarbo, J.J.

January 1996

Contains fulltext : 28107___.PDF (publisher's version ) (Open Access

Two simple sets that are not positively Borel

Veldman, W.H.M.

January 2005

Contains fulltext : 33125.pdf (Publisher’s version ) (Closed access

Sublinear Scaling for Multi-Client Private Information Retrieval

Lueks, W.
Goldberg, I.

January 2015

Contains fulltext : 143771.pdf (preprint version ) (Closed access

Complete sets of cooperations

Kupke, C.
Rutten, J.

January 2010

Contains fulltext : 83576.pdf (publisher's version ) (Closed access

Compactification and compactoidification

Beckenstein, E.
Narici, L.
Schikhof, W.H.

January 1995

Contains fulltext : 60076.pdf (publisher's version ) (Open Access

Decomposition of bounded degree graphs into C4-free subgraphs

Kang, J.R.
Perarnau, G.

January 2015

Contains fulltext : 141207.pdf (preprint version ) (Open Access

Separation Choosability and Dense Bipartite Induced Subgraphs

Esperet, Louis
Kang, Ross
Thomassé, Stéphan

January 2019

International audienceWe study a restricted form of list colouring, for which every pair of lists th...

Discrepancy and large dense monochromatic subsets

Kang, J.R.
Patel, V.
Regts, G.

January 2019

Contains fulltext : 204473.pdf (preprint version ) (Open Access

A decomposition theorem for domains

Haack, C.

January 1996

Contains fulltext : 161699.pdf (publisher's version ) (Open Access

Packing Graphs of Bounded Codegree

Cames van Batenburg, W.P.S.
Kang, J.R.

January 2018

Contains fulltext : 197583.pdf (publisher's version ) (Open Access

Toposes and groupoids

Moerdijk, I.

January 1988

Contains fulltext : 128966.pdf (publisher's version ) (Open Access

Supersaturation in the Boolean Lattice

Dove, A.P.
Griggs, J.R.
Kang, J.R.
Sereni, J.-S.

January 2014

Contains fulltext : 135163.pdf (preprint version ) (Open Access

Minimal Separating Sequences for All Pairs of States

Smetsers, R.
Moerman, J.S.
Jansen, D.N.

January 2016

Contains fulltext : 158117.pdf (publisher's version ) (Closed access

Two “simple” sets that are not positively Borel

Veldman, W.H.M.

January 2004

Contains fulltext : 60352.pdf (publisher's version ) (Open Access)53 p

Largest sparse subgraphs of random graphs

Fountoulakis, N.
Kang, J.R.
McDiarmid, C.

January 2014

Contains fulltext : 135134.pdf (preprint version ) (Open Access

Building sub-knowledge bases using concept lattices

Sarbo, J.J.

January 1996

Contains fulltext : 28107___.PDF (publisher's version ) (Open Access

Two simple sets that are not positively Borel

Veldman, W.H.M.

January 2005

Contains fulltext : 33125.pdf (Publisher’s version ) (Closed access

Sublinear Scaling for Multi-Client Private Information Retrieval

Lueks, W.
Goldberg, I.

January 2015

Contains fulltext : 143771.pdf (preprint version ) (Closed access

Complete sets of cooperations

Kupke, C.
Rutten, J.

January 2010

Contains fulltext : 83576.pdf (publisher's version ) (Closed access