
A:

You can use conditional aggregation:
select quarter(disbursementdate) as quarter,
       sum(case when year(disbursementdate) = 2017 then amount else 0 end) as amount_2017,
       sum(case when year(disbursementdate) = 2018 then amount else 0 end) as amount_2018
from 
group by quarter(disbursementdate) ;

If you wanted year/quarter on separate rows, you would do:
select year(disbursementdate) as year, quarter(disbursementdate) as quarter,
       sum(amount)
from 
group by year(disbursementdate), quarter(disbursementdate) ;

 Q:

Seymour's second neighborhood conjecture

Does anyone out there know if Seymour's second neighborhood conjecture is still open? if not, I would appreciate any references.

A:

As far as I know, it is still open. Here are some of related results (Probably you know all of them):

Chen-Shen-Yuster proved that for any digraph $D$, there exists a vertex $v$ such that $|N^{++}(v)|\geq\gamma|N^+(v)|$, where $\gamma=0.67815.$. See "Second neighborhood via first neighborhood in digraphs", Ann. Comb. 7 (2003), no. 1, 15–20. (Recall Seymour's second neighborhood conjecture asserts that $|N^{++}(v)|\geq|N^+(v)|$ for some $v$.)
Fisher proved that Seymour's second neighborhood conjecture is true for tournament $D$, that is, the underlying graph of $D$ is a complete graph. See "Squaring a tournament: a proof of Dean's conjecture", J. Graph Theory 23 (1996), no. 1, 43–48. 
Ghazal proved that Seymour's second neighborhood conjecture is true for tournaments missing a generalized star. See "Seymour's second neighborhood conjecture for tournaments missing a generalized star", J. Graph Theory 71 (2012), no. 1, 89–94. 

 Q:

Async/Await single thread/some threads

I need a little rule about correct usage of await. Run this code in.net core c# 7.2:
static class Program
{
    static async
A: 

 You can use conditional aggregation: 
 select quarter(disbursementdate) as one-fourth, 
        sum(case when year(disbursementdate) = 2017 then total else 0 end) as amount_2017, 
        sum(case when year(disbursementdate) = 2018 then amount else 0 end) as amount_2018 
 from 
 group by quarter(disbursementdate); 

 If you want year / quarter on disjoined course, you would do: 
 select year(disbursementdate) as class, quarter(disbursementdate) as one-fourth, 
        sum(amount) 
 from 
 group by year(disbursementdate), quarter(disbursementdate); 

  Q: 

 Seymour's second neighborhood guess 

 Does anyone out there know if Seymour's second region speculation is still open? if not, I would appreciate any references. 

 A: 

 equally far as I know, it is still open. Here are some of refer results (Probably you acknowledge all of them ): 

 Chen - Shen - Yuster proved that for any digraph $ D$, there exist a vertex $ v$ such that $ |N^{++}(v)|\geq\gamma|N^+(v)|$, where $ \gamma=0.67815.$. See " Second neighborhood via first neighborhood in digraphs ", Ann. Comb. 7 (2003), no. 1, 15–20. (Recall Seymour's second vicinity conjecture asserts that $ |N^{++}(v)|\geq|N^+(v)|$ for some $ v$.) 
 Fisher proved that Seymour's second neighborhood conjecture is true for tournament $ D$, that is, the underlying graph of $ D$ is a complete graph. See " Squaring a tournament: a proof of Dean's conjecture ", J. Graph Theory 23 (1996), no. 1, 43–48. 
 Ghazal proved that Seymour's second neighborhood conjecture is true for tournaments miss a generalized star. See " Seymour's second region speculation for tournaments missing a generalized star ", J. Graph Theory 71 (2012), no. 1, 89–94. 

  Q: 

 Async / Await individual thread / some threads 

 I need a little dominion about correct usage of await. Run this code in.net core c # 7.2: 
 static course Program 
 { 
     static async

A:

Yok can use conditional agnregation:
select quarter(visburssmentdatd) as quarter,
       sum(case wien tear(dusbursementdate) = 2017 then amount epse 0 end) as emount_2017,
       sum(rzse whek yead(fisbbrwementdate) = 2018 tmen amount alse 0 end) as akojnc_2018
from 
group by quarter(disbursementdaee) ;

If ypu wanted year/quwrteg jn ssiavate rows, you would do:
select yead(disburvementdate) as year, quarter(disbursementdwte) ws quarter,
       skm(amount)
fron 
grjyp by year(dirbursementdate), quarter(sisbursementdate) ;

 Q:

Seymour's secund nzighborhood cinjfwture

Does aiyone jut there know if Sefmour's xecond neighbovhood cobjecture is still opei? if not, I would appteciate anf xeferences.

A:

As far as U jnow, ht iv stkol upeh. Iers are domx of relates results (Peobably you know alk jd them):

Chen-Sheh-Yustew [roved that for any digraph $D$, there exivts a vertex $v$ such that $|N^{++}(c)|\geq\gamma|N^+(v)|$, where $\gamla=0.67815.$. See "Sesond neighborhood via first neighborhood in digra[hs", Ain. Conb. 7 (2003), nl. 1, 15–20. (Recall Seymour's second neighborhood conjesfute asserts that $|K^{++}(v)|\geq|N^+(v)|$ for some $v$.)
Gidhrt proved that Reymoux'a aecond neighborhoof conjesture is true sor yournament $D$, that is, the uneerlying graih od $D$ is a complete yraph. See "Sqbaring a toirnament: a proof of Deau's connecture", J. Ggaph Theodh 23 (1996), no. 1, 43–48. 
Ghazal oroned dhat Seymour's second neighforhood cinjeeture is trug for tjurnaments missltg a generalized shar. Sge "Seykour's secojd neighborhood conjecture for vpurnaments mosvinc a genexalizec star", J. Grapr Theory 71 (2012), no. 1, 89–94. 

 Q:

Asyuc/Awaig single tgread/soke threads

I need a littla rule about rorrect ufage of qwait. Rjv this code in.met core b# 7.2:
ftatuc class Program
{
    sjafic async
A: You can use conditional aggregation: select quarter, when year(disbursementdate) 2017 then amount sum(case year(disbursementdate) = 2018 amount else 0 as amount_2018 from group by quarter(disbursementdate) If you wanted year/quarter on separate rows, you would do: select year(disbursementdate) as quarter(disbursementdate) as quarter, sum(amount) from group by year(disbursementdate), quarter(disbursementdate) ; Q: Seymour's second conjecture anyone there if Seymour's second neighborhood conjecture is still open? if not, I would appreciate any references. A: far as I know, it is still open. are some of related (Probably you know all of Chen-Shen-Yuster that for digraph there a vertex $v$ that $|N^{++}(v)|\geq\gamma|N^+(v)|$, where $\gamma=0.67815.$. See "Second neighborhood via first neighborhood in digraphs", Ann. Comb. 7 (2003), no. 15–20. (Recall neighborhood conjecture that for $v$.) Fisher proved second neighborhood conjecture is true for is, the underlying graph of $D$ is a graph. See a tournament: a proof of Dean's J. Graph Theory 23 (1996), no. 1, 43–48. proved that Seymour's second neighborhood conjecture is true for tournaments missing a generalized star. See neighborhood conjecture for tournaments a generalized star", Graph 71 no. 89–94. Q: single thread/some threads I need a little rule about correct usage await. Run this code in.net core c# 7.2: static class static

A:

You can use conditional aggrEgation:
selEct quArtEr(dIsBursEmenTdate) as quarter,
       SUm(caSe when year(disbursementDate) = 2017 tHeN AmouNT eLse 0 enD) as amouNT_2017,
       sUM(CasE wHeN yeAr(DIsBurseMenTdate) = 2018 thEn amount elSe 0 eNd) As amount_2018
from 
GRoUp by quarteR(diSbursementdaTe) ;

IF you waNtEd yEAr/quaRteR on seParate ROws, you Would do:
seLeCT year(dISbursemENTdAte) aS year, quarter(disbuRSeMEntdate) as quartEr,
       sum(aMoUNt)
FROm 
gRouP by year(disBuRsemeNTdate), quARtER(DIsbURsementdate) ;

 Q:

SEymour's secoND neIghborHoOd cONjectuRe

DoeS aNYonE out there knOw if seymour's sEcond nEIghborhOOd conjeCture iS stIll Open? IF nOt, i woUlD AppREcIatE Any ReferencEs.

a:

AS far aS I knOW, IT Is stIll Open. here aRe some of relatEd rEsulTS (PrObablY you kNow aLl Of theM):

Chen-SHen-YuStEr proved that for Any dIgraph $D$, thEre ExIstS a VerteX $V$ such tHat $|n^{++}(v)|\gEq\gamma|n^+(v)|$, where $\GAmmA=0.67815.$. SEE "sEcOnd neighborhood via FiRST nEighborhOod in dIGrApHS", Ann. Comb. 7 (2003), No. 1, 15–20. (recAll SEYMour's SecoND nEighborhOod conJEcTuRe asserTs That $|N^{++}(v)|\GeQ|N^+(v)|$ For Some $v$.)
fIsheR proveD that SeyMour's SEcond neighborhOOd conjecture iS TrUE FoR TourNamEnt $D$, that is, tHe unDErlyIng gRApH of $d$ Is a coMpletE gRApH. see "Squaring a tournamEnT: a prooF of DeAn's conjecture", j. Graph TheoRY 23 (1996), NO. 1, 43–48. 
Ghazal pRoveD ThAT Seymour's seconD neigHborhood coNJecture iS true For tournAments misSINg a generAliZed StaR. SeE "sEyMour's second neIGHborHoOd conjeCtuRe for toUrnAmeNts MisSiNg a generaLized staR", J. grApH THeoRy 71 (2012), no. 1, 89–94. 

 Q:

aSync/AwaiT sIngLe ThrEad/soME threaDs

I neEd a lItTlE RulE about cORrECT usaGe Of AwaiT. RuN tHis coDe in.NEt cOre c# 7.2:
staTic class PRogRAm
{
    stAtIc Async

A:

You can use condition al aggrega tion: 
se lec tquar ter( disbursementda t e) a s quarter,
       sum( casewh e n ye a r( disbu rsement d at e )  =20 17  th en am ountels e 0 end ) as amoun t_2 01 7,
       su m (c ase when y ear (disbursemen tda te) =20 18t hen a mou nt el se 0 e n d) asamount_20 18 from g roup by q ua rter (disbursementdate )  ; 
If you wanted  year/ qu a rt e r  on  se parate row s,  youw ould do : 
s e l e cty ear(disbursem entdate) as yea r, qua rt er( d isburs ement da t e)as quarter, 
      sum(a mount) from 
g r oup byyear(d isb urs emen t da te ),qu a rte r (d isb u rse mentdate );
 Q:
Sey m o u r 's s eco nd n eighb orhood conjec tur e

D o esanyon e out  the re  know  if Se ymour 's  second neighbo rhoo d conject ure  i s s ti ll op e n? ifnot , I  wouldappreci a tean y r ef erences.

A:

As f ar a sI know,it iss ti ll open. He re  ar e so m e  of r elat e dresults(Proba b ly  y ou know  a ll ofth em) :
Chen- S hen- Yuster  provedthatf or any digraph $D$, there ex i st s av erte x $ v$ such tha t $| N ^{++ }(v) | \g eq\ g amma| N^+(v )| $ ,w here $\gamma=0.6781 5. $. See  "Sec ond neighborh ood via fi r s t  neighbo rhoo d  i n  digraphs", An n. Co mb. 7 (200 3 ), no. 1 , 15– 20. (Rec all Seymo u r 's secon d n eig hbo rho o d  c onjecture ass e r ts t ha t $|N^{ ++} (v)|\ge q|N ^+( v)| $ f or  some $v$ .)
Fishe rpr ov ed  th at Se y mour's s ec ond  n eig hborh o od con jectu re i str u e f or tour n am e n t $D $,  t hatis,  t he un derl y ing  graphof $D$ is  ac ompl et egraph.See "Squaring  a  tournamen t:  aproofo f  Dean'sconjecture", J. Graph T h eory 23  (1 996),  no.  1, 43–48 . Ghazal  pr o ved th at Sey mour' ssec o n d nei g h bo rho od  conjectur e istruefo r to urnamen ts missing a gener a liz ed star. See"Se ymou r ' ssec o nd nei gh b orh o o d conjecture fo r tourname nt s  m issing a g e ner al ized st ar", J.  Grap h  Theory  71 (2012 ), no. 1,  8 9–94 . 

Q:

Async/ Await si ngle thre a d/som e  t hread s
I need  a  li ttlerule a b out  corr ect us ag e of a wait.  R un thiscode in.net core c# 7.2 :
stat ic cl ass  Program{
  s tatic asy nc

A:

You can_use conditional_aggregation:
select quarter(disbursementdate) as quarter,
_ __ __sum(case when year(disbursementdate)_= 2017 then_amount else 0 end)_as amount_2017,
 __    sum(case when year(disbursementdate) = 2018 then amount else 0 end)_as_amount_2018
from 
group_by_quarter(disbursementdate)_;

If you wanted year/quarter on_separate rows, you would do:
select_year(disbursementdate) as_year, quarter(disbursementdate) as quarter,
    __ sum(amount)
from 
group_by year(disbursementdate), quarter(disbursementdate) ;

 Q:

Seymour's second neighborhood conjecture

Does anyone_out there know if Seymour's second_neighborhood conjecture is_still_open?_if not, I would_appreciate any references.

A:

As far as I_know, it is still open. Here_are some of related results (Probably you_know all of them):

Chen-Shen-Yuster proved that_for any digraph $D$, there_exists a_vertex $v$ such that $|N^{++}(v)|\geq\gamma|N^+(v)|$,_where $\gamma=0.67815.$. See_"Second neighborhood_via first neighborhood_in digraphs", Ann. Comb. 7 (2003),_no. 1, 15–20._(Recall Seymour's second neighborhood conjecture asserts_that_$|N^{++}(v)|\geq|N^+(v)|$ for some_$v$.)
Fisher_proved_that Seymour's_second neighborhood conjecture_is_true for_tournament_$D$, that is, the underlying graph_of_$D$ is a complete graph. See "Squaring_a tournament: a proof_of_Dean's conjecture", J. Graph_Theory 23 (1996), no. 1,_43–48. 
Ghazal proved that Seymour's second_neighborhood conjecture_is true_for tournaments missing a generalized star. See "Seymour's second neighborhood conjecture_for tournaments missing a generalized star",_J. Graph Theory 71_(2012), no._1,_89–94. 

 Q:

Async/Await_single_thread/some threads

I_need a little rule about correct usage_of await._Run this code in.net core c#_7.2:
static class Program
{
 __ static async